Base | Representation |
---|---|
bin | 10010101001100010… |
… | …01000100110011101 |
3 | 221211202112102121100 |
4 | 21110301020212131 |
5 | 131001044213041 |
6 | 4333254023313 |
7 | 503052311616 |
oct | 112461104635 |
9 | 27752472540 |
10 | 10012101021 |
11 | 427862a75a |
12 | 1b35047b39 |
13 | c37366440 |
14 | 6ad9d2c0d |
15 | 3d8e9d6b6 |
hex | 254c4899d |
10012101021 has 12 divisors (see below), whose sum is σ = 15574379548. Its totient is φ = 6161292864.
The previous prime is 10012101019. The next prime is 10012101059. The reversal of 10012101021 is 12010121001.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 5518409796 + 4493691225 = 74286^2 + 67035^2 .
It is not a de Polignac number, because 10012101021 - 21 = 10012101019 is a prime.
It is a super-3 number, since 3×100121010213 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10012100994 and 10012101012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10012151021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 42786640 + ... + 42786873.
Almost surely, 210012101021 is an apocalyptic number.
It is an amenable number.
10012101021 is a deficient number, since it is larger than the sum of its proper divisors (5562278527).
10012101021 is a wasteful number, since it uses less digits than its factorization.
10012101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85573532 (or 85573529 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10012101021 its reverse (12010121001), we get a palindrome (22022222022).
The spelling of 10012101021 in words is "ten billion, twelve million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •