Base | Representation |
---|---|
bin | 1011111100010010010000… |
… | …1100001111000010101101 |
3 | 1201111020122201201210021122 |
4 | 2333010210030033002231 |
5 | 3210111344441222424 |
6 | 43531553045510325 |
7 | 2523430424203364 |
oct | 277044414170255 |
9 | 51436581653248 |
10 | 13130322210989 |
11 | 42025a16437a5 |
12 | 15808b24123a5 |
13 | 743251536629 |
14 | 3357222067db |
15 | 17b83a94545e |
hex | bf12430f0ad |
13130322210989 has 2 divisors, whose sum is σ = 13130322210990. Its totient is φ = 13130322210988.
The previous prime is 13130322210959. The next prime is 13130322210997. The reversal of 13130322210989 is 98901222303131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9290517361225 + 3839804849764 = 3048035^2 + 1959542^2 .
It is an emirp because it is prime and its reverse (98901222303131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13130322210989 - 212 = 13130322206893 is a prime.
It is a super-2 number, since 2×131303222109892 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13130322210959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565161105494 + 6565161105495.
It is an arithmetic number, because the mean of its divisors is an integer number (6565161105495).
Almost surely, 213130322210989 is an apocalyptic number.
It is an amenable number.
13130322210989 is a deficient number, since it is larger than the sum of its proper divisors (1).
13130322210989 is an equidigital number, since it uses as much as digits as its factorization.
13130322210989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 44.
The spelling of 13130322210989 in words is "thirteen trillion, one hundred thirty billion, three hundred twenty-two million, two hundred ten thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •