Base | Representation |
---|---|
bin | 1011000001100110011000… |
… | …0011111100111001011011 |
3 | 1120220212021200121220020122 |
4 | 2300121212003330321123 |
5 | 3042102040131134321 |
6 | 41440453115343455 |
7 | 2360536121040161 |
oct | 260314603747133 |
9 | 46825250556218 |
10 | 12122110021211 |
11 | 3953a5a0a2103 |
12 | 143941a151b8b |
13 | 69c157a931c8 |
14 | 2dc9db25d231 |
15 | 1604cd26c8ab |
hex | b06660fce5b |
12122110021211 has 16 divisors (see below), whose sum is σ = 12457978996320. Its totient is φ = 11788699668480.
The previous prime is 12122110021129. The next prime is 12122110021223. The reversal of 12122110021211 is 11212001122121.
It is a cyclic number.
It is not a de Polignac number, because 12122110021211 - 214 = 12122110004827 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12122110021211.
It is not an unprimeable number, because it can be changed into a prime (12122110021291) by changing a digit.
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, 302964575 + ... + 303004583.
It is an arithmetic number, because the mean of its divisors is an integer number (778623687270).
Almost surely, 212122110021211 is an apocalyptic number.
12122110021211 is a deficient number, since it is larger than the sum of its proper divisors (335868975109).
12122110021211 is a wasteful number, since it uses less digits than its factorization.
12122110021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70526.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 12122110021211 its reverse (11212001122121), we get a palindrome (23334111143332).
The spelling of 12122110021211 in words is "twelve trillion, one hundred twenty-two billion, one hundred ten million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •