Base | Representation |
---|---|
bin | 11110100100110011011… |
… | …100110111010001110010 |
3 | 21102212022102111101010020 |
4 | 132210303130313101302 |
5 | 233411024131242320 |
6 | 4245122200144310 |
7 | 304541162062161 |
oct | 36446334672162 |
9 | 7385272441106 |
10 | 2101102212210 |
11 | 740088472271 |
12 | 29b25aa68096 |
13 | 12319651a691 |
14 | 739a00673d8 |
15 | 399c3d88940 |
hex | 1e933737472 |
2101102212210 has 32 divisors (see below), whose sum is σ = 5048529437952. Its totient is φ = 559640131200.
The previous prime is 2101102212191. The next prime is 2101102212239. The reversal of 2101102212210 is 122122011012.
It is a super-4 number, since 4×21011022122104 (a number of 50 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2101102212210.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40835866 + ... + 40887285.
It is an arithmetic number, because the mean of its divisors is an integer number (157766544936).
Almost surely, 22101102212210 is an apocalyptic number.
2101102212210 is an abundant number, since it is smaller than the sum of its proper divisors (2947427225742).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101102212210 is a wasteful number, since it uses less digits than its factorization.
2101102212210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81724018.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2101102212210 its reverse (122122011012), we get a palindrome (2223224223222).
The spelling of 2101102212210 in words is "two trillion, one hundred one billion, one hundred two million, two hundred twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •