Base | Representation |
---|---|
bin | 1100000010010001001101… |
… | …1010110010110111010111 |
3 | 1201212001222212222001220212 |
4 | 3000210103122302313113 |
5 | 3213302412211431132 |
6 | 44051113355520035 |
7 | 2534030023225202 |
oct | 300442332626727 |
9 | 51761885861825 |
10 | 13233120030167 |
11 | 42421532a7854 |
12 | 159880115901b |
13 | 74cb5488b77b |
14 | 33a6b4a80939 |
15 | 17e3555d85b2 |
hex | c09136b2dd7 |
13233120030167 has 2 divisors, whose sum is σ = 13233120030168. Its totient is φ = 13233120030166.
The previous prime is 13233120030131. The next prime is 13233120030199. The reversal of 13233120030167 is 76103002133231.
13233120030167 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (13233120030199) can be obtained adding 13233120030167 to its sum of digits (32).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13233120030167 - 226 = 13233052921303 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13233120030107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6616560015083 + 6616560015084.
It is an arithmetic number, because the mean of its divisors is an integer number (6616560015084).
Almost surely, 213233120030167 is an apocalyptic number.
13233120030167 is a deficient number, since it is larger than the sum of its proper divisors (1).
13233120030167 is an equidigital number, since it uses as much as digits as its factorization.
13233120030167 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13608, while the sum is 32.
Adding to 13233120030167 its reverse (76103002133231), we get a palindrome (89336122163398).
The spelling of 13233120030167 in words is "thirteen trillion, two hundred thirty-three billion, one hundred twenty million, thirty thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •