Base | Representation |
---|---|
bin | 1011111100010010001101… |
… | …1110000111111000011101 |
3 | 1201111020121212222122201201 |
4 | 2333010203132013320131 |
5 | 3210111333342414122 |
6 | 43531551534435501 |
7 | 2523430216356502 |
oct | 277044336077035 |
9 | 51436555878651 |
10 | 13130310123037 |
11 | 4202595837958 |
12 | 15808aa362b91 |
13 | 74324bb935b3 |
14 | 33572077b4a9 |
15 | 17b839858a27 |
hex | bf123787e1d |
13130310123037 has 2 divisors, whose sum is σ = 13130310123038. Its totient is φ = 13130310123036.
The previous prime is 13130310123013. The next prime is 13130310123043. The reversal of 13130310123037 is 73032101303131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9848085843556 + 3282224279481 = 3138166^2 + 1811691^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13130310123037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13130310122996 and 13130310123014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13130310123137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565155061518 + 6565155061519.
It is an arithmetic number, because the mean of its divisors is an integer number (6565155061519).
Almost surely, 213130310123037 is an apocalyptic number.
It is an amenable number.
13130310123037 is a deficient number, since it is larger than the sum of its proper divisors (1).
13130310123037 is an equidigital number, since it uses as much as digits as its factorization.
13130310123037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3402, while the sum is 28.
Adding to 13130310123037 its reverse (73032101303131), we get a palindrome (86162411426168).
The spelling of 13130310123037 in words is "thirteen trillion, one hundred thirty billion, three hundred ten million, one hundred twenty-three thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •