Base | Representation |
---|---|
bin | 10001101000111101011… |
… | …110100111000110000101 |
3 | 11021212221011010202121100 |
4 | 101220331132213012011 |
5 | 124330102311241401 |
6 | 2324514350410313 |
7 | 153402514535652 |
oct | 21507536470605 |
9 | 4255834122540 |
10 | 1212212212101 |
11 | 428107211870 |
12 | 176b27500999 |
13 | 8a4076c1207 |
14 | 429583c6c29 |
15 | 217ebdc8b86 |
hex | 11a3d7a7185 |
1212212212101 has 72 divisors (see below), whose sum is σ = 1998066260736. Its totient is φ = 702290920320.
The previous prime is 1212212212063. The next prime is 1212212212187. The reversal of 1212212212101 is 1012122122121.
1212212212101 is a `hidden beast` number, since 1 + 212 + 21 + 221 + 210 + 1 = 666.
It is not a de Polignac number, because 1212212212101 - 29 = 1212212211589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1212212212501) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 95465985 + ... + 95478681.
It is an arithmetic number, because the mean of its divisors is an integer number (27750920288).
Almost surely, 21212212212101 is an apocalyptic number.
1212212212101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1212212212101 is a deficient number, since it is larger than the sum of its proper divisors (785854048635).
1212212212101 is a wasteful number, since it uses less digits than its factorization.
1212212212101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14583 (or 14557 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 1212212212101 its reverse (1012122122121), we get a palindrome (2224334334222).
The spelling of 1212212212101 in words is "one trillion, two hundred twelve billion, two hundred twelve million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •