Base | Representation |
---|---|
bin | 11101101000010000110110… |
… | …111110111010000111111011 |
3 | 122002101112110222220101220101 |
4 | 131220100312332322013323 |
5 | 114040000322414040212 |
6 | 1141051405432140231 |
7 | 36306413661113203 |
oct | 3550206676720773 |
9 | 562345428811811 |
10 | 130310230221307 |
11 | 38580292863184 |
12 | 12746bb4537677 |
13 | 57932819aa186 |
14 | 2427097c71403 |
15 | 100ea04e3e157 |
hex | 768436fba1fb |
130310230221307 has 2 divisors, whose sum is σ = 130310230221308. Its totient is φ = 130310230221306.
The previous prime is 130310230221271. The next prime is 130310230221361. The reversal of 130310230221307 is 703122032013031.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (703122032013031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130310230221307 - 219 = 130310229697019 is a prime.
It is a super-2 number, since 2×1303102302213072 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (130310230221007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65155115110653 + 65155115110654.
It is an arithmetic number, because the mean of its divisors is an integer number (65155115110654).
Almost surely, 2130310230221307 is an apocalyptic number.
130310230221307 is a deficient number, since it is larger than the sum of its proper divisors (1).
130310230221307 is an equidigital number, since it uses as much as digits as its factorization.
130310230221307 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 28.
Adding to 130310230221307 its reverse (703122032013031), we get a palindrome (833432262234338).
The spelling of 130310230221307 in words is "one hundred thirty trillion, three hundred ten billion, two hundred thirty million, two hundred twenty-one thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •