Base | Representation |
---|---|
bin | 1001001100000000111000… |
… | …1011101000110110011001 |
3 | 1022202202000211010112200010 |
4 | 2103000032023220312121 |
5 | 2311002344224341441 |
6 | 33252443432432133 |
7 | 2061563000551344 |
oct | 223001613506631 |
9 | 38682024115603 |
10 | 10102001012121 |
11 | 3245264238147 |
12 | 1171a03848649 |
13 | 5837cb3a7bb5 |
14 | 26cd21c2d45b |
15 | 127b99b90116 |
hex | 9300e2e8d99 |
10102001012121 has 16 divisors (see below), whose sum is σ = 13948250570240. Its totient is φ = 6496597560960.
The previous prime is 10102001012119. The next prime is 10102001012141. The reversal of 10102001012121 is 12121010020101.
It is not a de Polignac number, because 10102001012121 - 21 = 10102001012119 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10102001012097 and 10102001012106.
It is not an unprimeable number, because it can be changed into a prime (10102001012111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 173491126 + ... + 173549343.
It is an arithmetic number, because the mean of its divisors is an integer number (871765660640).
Almost surely, 210102001012121 is an apocalyptic number.
It is an amenable number.
10102001012121 is a deficient number, since it is larger than the sum of its proper divisors (3846249558119).
10102001012121 is a wasteful number, since it uses less digits than its factorization.
10102001012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347040816.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10102001012121 its reverse (12121010020101), we get a palindrome (22223011032222).
The spelling of 10102001012121 in words is "ten trillion, one hundred two billion, one million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •