Base | Representation |
---|---|
bin | 10001100111000110010… |
… | …000011101000001011010 |
3 | 11021200202202102002001122 |
4 | 101213012100131001122 |
5 | 124312003233341442 |
6 | 2323544055245242 |
7 | 153302116242101 |
oct | 21470620350132 |
9 | 4250682362048 |
10 | 1210212012122 |
11 | 427280148a33 |
12 | 176669679822 |
13 | 8a1791a6b29 |
14 | 428088b9038 |
15 | 217314c6dd2 |
hex | 119c641d05a |
1210212012122 has 16 divisors (see below), whose sum is σ = 1828455061632. Its totient is φ = 600742772640.
The previous prime is 1210212012077. The next prime is 1210212012127. The reversal of 1210212012122 is 2212102120121.
It is a super-2 number, since 2×12102120121222 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1210212012122.
It is not an unprimeable number, because it can be changed into a prime (1210212012127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3791603 + ... + 4098374.
It is an arithmetic number, because the mean of its divisors is an integer number (114278441352).
Almost surely, 21210212012122 is an apocalyptic number.
1210212012122 is a deficient number, since it is larger than the sum of its proper divisors (618243049510).
1210212012122 is a wasteful number, since it uses less digits than its factorization.
1210212012122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7890533.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1210212012122 its reverse (2212102120121), we get a palindrome (3422314132243).
It can be divided in two parts, 12102120121 and 22, that multiplied together give a palindrome (266246642662).
The spelling of 1210212012122 in words is "one trillion, two hundred ten billion, two hundred twelve million, twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •