Base | Representation |
---|---|
bin | 101111101111111010101011… |
… | …100110101010111111011001 |
3 | 1000112112220022110101020120010 |
4 | 233233322223212222333121 |
5 | 210011124032030341441 |
6 | 2022345044314352133 |
7 | 62143033536642636 |
oct | 5757725346527731 |
9 | 1015486273336503 |
10 | 210001010012121 |
11 | 60a04a23489429 |
12 | 1b67772942b649 |
13 | 902401974b7c3 |
14 | 39c0162d4918d |
15 | 194291c9e0116 |
hex | befeab9aafd9 |
210001010012121 has 16 divisors (see below), whose sum is σ = 289664918832960. Its totient is φ = 135169165709760.
The previous prime is 210001010012119. The next prime is 210001010012149. The reversal of 210001010012121 is 121210010100012.
It is not a de Polignac number, because 210001010012121 - 21 = 210001010012119 is a prime.
It is a super-2 number, since 2×2100010100121212 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210001010012097 and 210001010012106.
It is not an unprimeable number, because it can be changed into a prime (210001010019121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31769775 + ... + 37806356.
It is an arithmetic number, because the mean of its divisors is an integer number (18104057427060).
Almost surely, 2210001010012121 is an apocalyptic number.
It is an amenable number.
210001010012121 is a deficient number, since it is larger than the sum of its proper divisors (79663908820839).
210001010012121 is a wasteful number, since it uses less digits than its factorization.
210001010012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69610856.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 210001010012121 its reverse (121210010100012), we get a palindrome (331211020112133).
The spelling of 210001010012121 in words is "two hundred ten trillion, one billion, ten million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •