Base | Representation |
---|---|
bin | 1000001011001001101… |
… | …1000110101001010111 |
3 | 111102110222100020012021 |
4 | 2002302123012221113 |
5 | 4300101143344111 |
6 | 144302545434011 |
7 | 13101021505354 |
oct | 2026233065127 |
9 | 442428306167 |
10 | 140432403031 |
11 | 54614480a18 |
12 | 2327263b907 |
13 | 1032033a28b |
14 | 6b22c2962b |
15 | 39bdb85d71 |
hex | 20b26c6a57 |
140432403031 has 8 divisors (see below), whose sum is σ = 142385725440. Its totient is φ = 138492323928.
The previous prime is 140432403011. The next prime is 140432403073. The reversal of 140432403031 is 130304234041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140432403031 - 215 = 140432370263 is a prime.
It is a super-2 number, since 2×1404324030312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140432402987 and 140432403005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140432403011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3289471 + ... + 3331888.
It is an arithmetic number, because the mean of its divisors is an integer number (17798215680).
Almost surely, 2140432403031 is an apocalyptic number.
140432403031 is a deficient number, since it is larger than the sum of its proper divisors (1953322409).
140432403031 is a wasteful number, since it uses less digits than its factorization.
140432403031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6621653.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 140432403031 its reverse (130304234041), we get a palindrome (270736637072).
The spelling of 140432403031 in words is "one hundred forty billion, four hundred thirty-two million, four hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •