Base | Representation |
---|---|
bin | 11101101000010011101110… |
… | …000001001010100000010111 |
3 | 122002101211102000012022122102 |
4 | 131220103232001022200113 |
5 | 114040023120031340343 |
6 | 1141053034250352315 |
7 | 36306553036504604 |
oct | 3550235601124027 |
9 | 562354360168572 |
10 | 130313301043223 |
11 | 385816191a6131 |
12 | 12747710a2b69b |
13 | 5793650c5a36c |
14 | 24272a9a316ab |
15 | 100eb348223b8 |
hex | 7684ee04a817 |
130313301043223 has 2 divisors, whose sum is σ = 130313301043224. Its totient is φ = 130313301043222.
The previous prime is 130313301043207. The next prime is 130313301043273. The reversal of 130313301043223 is 322340103313031.
It is a weak prime.
It is an emirp because it is prime and its reverse (322340103313031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130313301043223 - 24 = 130313301043207 is a prime.
It is a super-2 number, since 2×1303133010432232 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130313301043273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65156650521611 + 65156650521612.
It is an arithmetic number, because the mean of its divisors is an integer number (65156650521612).
Almost surely, 2130313301043223 is an apocalyptic number.
130313301043223 is a deficient number, since it is larger than the sum of its proper divisors (1).
130313301043223 is an equidigital number, since it uses as much as digits as its factorization.
130313301043223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 130313301043223 its reverse (322340103313031), we get a palindrome (452653404356254).
The spelling of 130313301043223 in words is "one hundred thirty trillion, three hundred thirteen billion, three hundred one million, forty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •