Base | Representation |
---|---|
bin | 1011111100010010001100… |
… | …0011110000001110000001 |
3 | 1201111020121101222110022222 |
4 | 2333010203003300032001 |
5 | 3210111330110212434 |
6 | 43531551130340425 |
7 | 2523430103536112 |
oct | 277044303601601 |
9 | 51436541873288 |
10 | 13130303210369 |
11 | 4202591946304 |
12 | 15808a7b8a715 |
13 | 74324a613067 |
14 | 33571d89c209 |
15 | 17b838e4072e |
hex | bf1230f0381 |
13130303210369 has 2 divisors, whose sum is σ = 13130303210370. Its totient is φ = 13130303210368.
The previous prime is 13130303210191. The next prime is 13130303210389. The reversal of 13130303210369 is 96301230303131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12051228934144 + 1079074276225 = 3471488^2 + 1038785^2 .
It is a cyclic number.
It is not a de Polignac number, because 13130303210369 - 220 = 13130302161793 is a prime.
It is a super-2 number, since 2×131303032103692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13130303210389) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565151605184 + 6565151605185.
It is an arithmetic number, because the mean of its divisors is an integer number (6565151605185).
Almost surely, 213130303210369 is an apocalyptic number.
It is an amenable number.
13130303210369 is a deficient number, since it is larger than the sum of its proper divisors (1).
13130303210369 is an equidigital number, since it uses as much as digits as its factorization.
13130303210369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26244, while the sum is 35.
The spelling of 13130303210369 in words is "thirteen trillion, one hundred thirty billion, three hundred three million, two hundred ten thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •