Base | Representation |
---|---|
bin | 111100111110010001… |
… | …1100001010000110111 |
3 | 110111222100021101201212 |
4 | 1321330203201100313 |
5 | 4121130302024301 |
6 | 140052530512035 |
7 | 12313532425325 |
oct | 1717443412067 |
9 | 414870241655 |
10 | 130938704951 |
11 | 5059253804a |
12 | 2146313561b |
13 | c469500452 |
14 | 64a201cd15 |
15 | 36154884bb |
hex | 1e7c8e1437 |
130938704951 has 2 divisors, whose sum is σ = 130938704952. Its totient is φ = 130938704950.
The previous prime is 130938704851. The next prime is 130938704957. The reversal of 130938704951 is 159407839031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130938704951 - 214 = 130938688567 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130938704951.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130938704957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65469352475 + 65469352476.
It is an arithmetic number, because the mean of its divisors is an integer number (65469352476).
Almost surely, 2130938704951 is an apocalyptic number.
130938704951 is a deficient number, since it is larger than the sum of its proper divisors (1).
130938704951 is an equidigital number, since it uses as much as digits as its factorization.
130938704951 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 816480, while the sum is 50.
The spelling of 130938704951 in words is "one hundred thirty billion, nine hundred thirty-eight million, seven hundred four thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •