Base | Representation |
---|---|
bin | 10010111000110110… |
… | …00011001100010111 |
3 | 222011201012021021010 |
4 | 21130123003030113 |
5 | 131231433420211 |
6 | 4354122423303 |
7 | 506202035514 |
oct | 113433031427 |
9 | 28151167233 |
10 | 10140529431 |
11 | 433407893a |
12 | 1b70061b33 |
13 | c57b51796 |
14 | 6c2aa430b |
15 | 3e53bb4a6 |
hex | 25c6c3317 |
10140529431 has 32 divisors (see below), whose sum is σ = 14076741888. Its totient is φ = 6487983360.
The previous prime is 10140529429. The next prime is 10140529433. The reversal of 10140529431 is 13492504101.
10140529431 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10140529429) and next prime (10140529433).
It is not a de Polignac number, because 10140529431 - 21 = 10140529429 is a prime.
It is a super-2 number, since 2×101405294312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140529433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2476696 + ... + 2480786.
It is an arithmetic number, because the mean of its divisors is an integer number (439898184).
Almost surely, 210140529431 is an apocalyptic number.
10140529431 is a deficient number, since it is larger than the sum of its proper divisors (3936212457).
10140529431 is a wasteful number, since it uses less digits than its factorization.
10140529431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4431.
The product of its (nonzero) digits is 4320, while the sum is 30.
The spelling of 10140529431 in words is "ten billion, one hundred forty million, five hundred twenty-nine thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •