Base | Representation |
---|---|
bin | 1011111100010001111011… |
… | …1001001100011010001111 |
3 | 1201111020102112111100010202 |
4 | 2333010132321030122033 |
5 | 3210111204213132031 |
6 | 43531540152524115 |
7 | 2523425264564126 |
oct | 277043671143217 |
9 | 51436375440122 |
10 | 13130233333391 |
11 | 4202556459739 |
12 | 15808886b063b |
13 | 743238cb8535 |
14 | 3357144acabd |
15 | 17b832c3b2cb |
hex | bf11ee4c68f |
13130233333391 has 2 divisors, whose sum is σ = 13130233333392. Its totient is φ = 13130233333390.
The previous prime is 13130233333361. The next prime is 13130233333403. The reversal of 13130233333391 is 19333333203131.
It is a strong prime.
It is an emirp because it is prime and its reverse (19333333203131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13130233333391 - 210 = 13130233332367 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13130233333361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565116666695 + 6565116666696.
It is an arithmetic number, because the mean of its divisors is an integer number (6565116666696).
Almost surely, 213130233333391 is an apocalyptic number.
13130233333391 is a deficient number, since it is larger than the sum of its proper divisors (1).
13130233333391 is an equidigital number, since it uses as much as digits as its factorization.
13130233333391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 118098, while the sum is 38.
The spelling of 13130233333391 in words is "thirteen trillion, one hundred thirty billion, two hundred thirty-three million, three hundred thirty-three thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •