Base | Representation |
---|---|
bin | 1001000110101010001010… |
… | …1000000100010100011000 |
3 | 1022102221120021011021102010 |
4 | 2101222202220010110120 |
5 | 2303000441031241440 |
6 | 33142310451105520 |
7 | 2052125120631501 |
oct | 221524250042430 |
9 | 38387507137363 |
10 | 10010002212120 |
11 | 320a24431a029 |
12 | 11580095a22a0 |
13 | 577c2943b831 |
14 | 2686b56a9ba8 |
15 | 1255b30db580 |
hex | 91aa2a04518 |
10010002212120 has 128 divisors (see below), whose sum is σ = 30802325400000. Its totient is φ = 2601486305280.
The previous prime is 10010002212103. The next prime is 10010002212127. The reversal of 10010002212120 is 2121220001001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 10010002212096 and 10010002212105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010002212127) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5474995 + ... + 7070754.
Almost surely, 210010002212120 is an apocalyptic number.
10010002212120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10010002212120 is an abundant number, since it is smaller than the sum of its proper divisors (20792323187880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010002212120 is a wasteful number, since it uses less digits than its factorization.
10010002212120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12545933 (or 12545929 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10010002212120 its reverse (2121220001001), we get a palindrome (12131222213121).
The spelling of 10010002212120 in words is "ten trillion, ten billion, two million, two hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •