Base | Representation |
---|---|
bin | 1011110110100100000110… |
… | …0001001111101010101111 |
3 | 1201010211221120121121220022 |
4 | 2331221001201033222233 |
5 | 3202004044140310111 |
6 | 43414455410512355 |
7 | 2513350565242004 |
oct | 275510141175257 |
9 | 51124846547808 |
10 | 13032030010031 |
11 | 417494221836a |
12 | 15658405956bb |
13 | 736bb87a4286 |
14 | 330a79cdb8ab |
15 | 178ed66002db |
hex | bda4184faaf |
13032030010031 has 2 divisors, whose sum is σ = 13032030010032. Its totient is φ = 13032030010030.
The previous prime is 13032030009941. The next prime is 13032030010067. The reversal of 13032030010031 is 13001003023031.
It is a strong prime.
It is an emirp because it is prime and its reverse (13001003023031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13032030010031 - 210 = 13032030009007 is a prime.
It is a super-2 number, since 2×130320300100312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13032030009991 and 13032030010009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13032030040031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6516015005015 + 6516015005016.
It is an arithmetic number, because the mean of its divisors is an integer number (6516015005016).
Almost surely, 213032030010031 is an apocalyptic number.
13032030010031 is a deficient number, since it is larger than the sum of its proper divisors (1).
13032030010031 is an equidigital number, since it uses as much as digits as its factorization.
13032030010031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 13032030010031 its reverse (13001003023031), we get a palindrome (26033033033062).
The spelling of 13032030010031 in words is "thirteen trillion, thirty-two billion, thirty million, ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •