Base | Representation |
---|---|
bin | 11101101010100000100001… |
… | …010000001001010110011111 |
3 | 122002221021122020110211200021 |
4 | 131222200201100021112133 |
5 | 114100012231010322111 |
6 | 1141250320132013011 |
7 | 36323514355413364 |
oct | 3552404120112637 |
9 | 562837566424607 |
10 | 130464484464031 |
11 | 3862a74a306903 |
12 | 12770a83a61167 |
13 | 57a4995747903 |
14 | 243072c63846b |
15 | 1013a32264d71 |
hex | 76a82140959f |
130464484464031 has 2 divisors, whose sum is σ = 130464484464032. Its totient is φ = 130464484464030.
The previous prime is 130464484464029. The next prime is 130464484464131.
130464484464031 is nontrivially palindromic in base 10.
It is a weak prime.
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 130464484464031 - 21 = 130464484464029 is a prime.
It is a super-2 number, since 2×1304644844640312 (a number of 29 digits) contains 22 as substring.
Together with 130464484464029, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 130464484464031.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130464484464131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65232242232015 + 65232242232016.
It is an arithmetic number, because the mean of its divisors is an integer number (65232242232016).
Almost surely, 2130464484464031 is an apocalyptic number.
130464484464031 is a deficient number, since it is larger than the sum of its proper divisors (1).
130464484464031 is an equidigital number, since it uses as much as digits as its factorization.
130464484464031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10616832, while the sum is 52.
The spelling of 130464484464031 in words is "one hundred thirty trillion, four hundred sixty-four billion, four hundred eighty-four million, four hundred sixty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •