Base | Representation |
---|---|
bin | 10010110100000001… |
… | …01001000110100110 |
3 | 222001220000211012110 |
4 | 21122000221012212 |
5 | 131141103134030 |
6 | 4350115101450 |
7 | 505201012611 |
oct | 113200510646 |
9 | 28056024173 |
10 | 10100052390 |
11 | 431324193a |
12 | 1b5a5a1886 |
13 | c4c64ba7c |
14 | 6bb569178 |
15 | 3e1a731b0 |
hex | 25a0291a6 |
10100052390 has 32 divisors (see below), whose sum is σ = 24244777440. Its totient is φ = 2692830464.
The previous prime is 10100052229. The next prime is 10100052439. The reversal of 10100052390 is 9325000101.
It is a super-2 number, since 2×101000523902 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 142066 + ... + 200954.
It is an arithmetic number, because the mean of its divisors is an integer number (757649295).
Almost surely, 210100052390 is an apocalyptic number.
10100052390 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10100052390 is an abundant number, since it is smaller than the sum of its proper divisors (14144725050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100052390 is a wasteful number, since it uses less digits than its factorization.
10100052390 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64616.
The product of its (nonzero) digits is 270, while the sum is 21.
Adding to 10100052390 its reverse (9325000101), we get a palindrome (19425052491).
The spelling of 10100052390 in words is "ten billion, one hundred million, fifty-two thousand, three hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •