Base | Representation |
---|---|
bin | 100000001010010101011… |
… | …110111101000111110001 |
3 | 21211021201010210012021110 |
4 | 200022111132331013301 |
5 | 242202312001010001 |
6 | 4411152101343533 |
7 | 315450601320300 |
oct | 40122536750761 |
9 | 7737633705243 |
10 | 2210121110001 |
11 | 782341826802 |
12 | 2b8405107ba9 |
13 | 13054b695c1c |
14 | 78d82c1c437 |
15 | 3c754c843d6 |
hex | 202957bd1f1 |
2210121110001 has 48 divisors (see below), whose sum is σ = 3522620417856. Its totient is φ = 1228084550784.
The previous prime is 2210121109997. The next prime is 2210121110009. The reversal of 2210121110001 is 1000111210122.
2210121110001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2210121110001 - 22 = 2210121109997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2210121110009) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9385635 + ... + 9618231.
It is an arithmetic number, because the mean of its divisors is an integer number (73387925372).
Almost surely, 22210121110001 is an apocalyptic number.
2210121110001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2210121110001 is a deficient number, since it is larger than the sum of its proper divisors (1312499307855).
2210121110001 is a wasteful number, since it uses less digits than its factorization.
2210121110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234398 (or 234391 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2210121110001 its reverse (1000111210122), we get a palindrome (3210232320123).
The spelling of 2210121110001 in words is "two trillion, two hundred ten billion, one hundred twenty-one million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •