Base | Representation |
---|---|
bin | 1011001001111000100001… |
… | …1110000110001011001111 |
3 | 1121102110121121020220011122 |
4 | 2302132020132012023033 |
5 | 3101420013313033241 |
6 | 42030110342311155 |
7 | 2404034535215405 |
oct | 262361036061317 |
9 | 47373547226148 |
10 | 12264421221071 |
11 | 39a9348056978 |
12 | 1460b15a284bb |
13 | 6ac6b741c086 |
14 | 30585b7d3475 |
15 | 16405bd2404b |
hex | b27887862cf |
12264421221071 has 2 divisors, whose sum is σ = 12264421221072. Its totient is φ = 12264421221070.
The previous prime is 12264421220971. The next prime is 12264421221077. The reversal of 12264421221071 is 17012212446221.
12264421221071 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (17012212446221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12264421221071 - 226 = 12264354112207 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12264421221077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6132210610535 + 6132210610536.
It is an arithmetic number, because the mean of its divisors is an integer number (6132210610536).
Almost surely, 212264421221071 is an apocalyptic number.
12264421221071 is a deficient number, since it is larger than the sum of its proper divisors (1).
12264421221071 is an equidigital number, since it uses as much as digits as its factorization.
12264421221071 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21504, while the sum is 35.
Adding to 12264421221071 its reverse (17012212446221), we get a palindrome (29276633667292).
The spelling of 12264421221071 in words is "twelve trillion, two hundred sixty-four billion, four hundred twenty-one million, two hundred twenty-one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •