Base | Representation |
---|---|
bin | 111100100010111011… |
… | …1111100011000001101 |
3 | 110102121102001000012122 |
4 | 1321011313330120031 |
5 | 4112240423441023 |
6 | 135421515542325 |
7 | 12252022626335 |
oct | 1710567743015 |
9 | 412542030178 |
10 | 130021312013 |
11 | 5016170616a |
12 | 21247a5a9a5 |
13 | c3514271a8 |
14 | 64162560c5 |
15 | 35aeb732c8 |
hex | 1e45dfc60d |
130021312013 has 2 divisors, whose sum is σ = 130021312014. Its totient is φ = 130021312012.
The previous prime is 130021311997. The next prime is 130021312021. The reversal of 130021312013 is 310213120031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 123835017604 + 6186294409 = 351902^2 + 78653^2 .
It is a cyclic number.
It is not a de Polignac number, because 130021312013 - 24 = 130021311997 is a prime.
It is a super-2 number, since 2×1300213120132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130021311982 and 130021312000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130021315013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65010656006 + 65010656007.
It is an arithmetic number, because the mean of its divisors is an integer number (65010656007).
Almost surely, 2130021312013 is an apocalyptic number.
It is an amenable number.
130021312013 is a deficient number, since it is larger than the sum of its proper divisors (1).
130021312013 is an equidigital number, since it uses as much as digits as its factorization.
130021312013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 130021312013 its reverse (310213120031), we get a palindrome (440234432044).
The spelling of 130021312013 in words is "one hundred thirty billion, twenty-one million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •