Base | Representation |
---|---|
bin | 111100101000101100… |
… | …0101001011001101011 |
3 | 110110002212102122100001 |
4 | 1321101120221121223 |
5 | 4113134343400121 |
6 | 135453015123431 |
7 | 12256556300365 |
oct | 1712130513153 |
9 | 413085378301 |
10 | 130214434411 |
11 | 50250720956 |
12 | 212a0673577 |
13 | c382443bb9 |
14 | 6433b67d35 |
15 | 35c1abe991 |
hex | 1e5162966b |
130214434411 has 2 divisors, whose sum is σ = 130214434412. Its totient is φ = 130214434410.
The previous prime is 130214434409. The next prime is 130214434429. The reversal of 130214434411 is 114434412031.
It is a weak prime.
It is an emirp because it is prime and its reverse (114434412031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130214434411 - 21 = 130214434409 is a prime.
Together with 130214434409, 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 130214434411.
It is not a weakly prime, because it can be changed into another prime (130214434481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65107217205 + 65107217206.
It is an arithmetic number, because the mean of its divisors is an integer number (65107217206).
Almost surely, 2130214434411 is an apocalyptic number.
130214434411 is a deficient number, since it is larger than the sum of its proper divisors (1).
130214434411 is an equidigital number, since it uses as much as digits as its factorization.
130214434411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 130214434411 its reverse (114434412031), we get a palindrome (244648846442).
The spelling of 130214434411 in words is "one hundred thirty billion, two hundred fourteen million, four hundred thirty-four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •