Base | Representation |
---|---|
bin | 10000101110111… |
… | …10100111101000 |
3 | 100210010122210212 |
4 | 20113132213220 |
5 | 241413404311 |
6 | 21532400252 |
7 | 3323101100 |
oct | 1027364750 |
9 | 323118725 |
10 | 140372456 |
11 | 722669a4 |
12 | 3b016088 |
13 | 2310aa33 |
14 | 14900200 |
15 | c4cbc8b |
hex | 85de9e8 |
140372456 has 96 divisors (see below), whose sum is σ = 329961600. Its totient is φ = 55641600.
The previous prime is 140372447. The next prime is 140372459. The reversal of 140372456 is 654273041.
140372456 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (140372459) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 349856 + ... + 350256.
It is an arithmetic number, because the mean of its divisors is an integer number (3437100).
Almost surely, 2140372456 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 140372456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164980800).
140372456 is an abundant number, since it is smaller than the sum of its proper divisors (189589144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140372456 is a wasteful number, since it uses less digits than its factorization.
140372456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 487 (or 476 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 32.
The square root of 140372456 is about 11847.8882506546. Note that the first 3 decimals coincide. The cubic root of 140372456 is about 519.7094728194.
The spelling of 140372456 in words is "one hundred forty million, three hundred seventy-two thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •