Base | Representation |
---|---|
bin | 11101100110101010001100… |
… | …110000000100010111001111 |
3 | 122001222222221212100002101211 |
4 | 131212222030300010113033 |
5 | 114031144100001200332 |
6 | 1140525015420315251 |
7 | 36265432242636511 |
oct | 3546521460042717 |
9 | 561888855302354 |
10 | 130200000021967 |
11 | 38538567783987 |
12 | 127297706a2b27 |
13 | 5785a658b1355 |
14 | 24219dc287bb1 |
15 | 100bc02a24447 |
hex | 766a8cc045cf |
130200000021967 has 2 divisors, whose sum is σ = 130200000021968. Its totient is φ = 130200000021966.
The previous prime is 130200000021937. The next prime is 130200000021989. The reversal of 130200000021967 is 769120000002031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130200000021967 - 211 = 130200000019919 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130200000021937) 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 as a sum of consecutive naturals, namely, 65100000010983 + 65100000010984.
It is an arithmetic number, because the mean of its divisors is an integer number (65100000010984).
Almost surely, 2130200000021967 is an apocalyptic number.
130200000021967 is a deficient number, since it is larger than the sum of its proper divisors (1).
130200000021967 is an equidigital number, since it uses as much as digits as its factorization.
130200000021967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 31.
Adding to 130200000021967 its reverse (769120000002031), we get a palindrome (899320000023998).
The spelling of 130200000021967 in words is "one hundred thirty trillion, two hundred billion, twenty-one thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •