Base | Representation |
---|---|
bin | 1100000110010010101011… |
… | …0001110110001111101111 |
3 | 1202002200101101020202002011 |
4 | 3001210222301312033233 |
5 | 3220420432221113111 |
6 | 44142543304542051 |
7 | 2542024460341222 |
oct | 301445261661757 |
9 | 52080341222064 |
10 | 13302231426031 |
11 | 4269498940439 |
12 | 15aa08a481927 |
13 | 756519b9c752 |
14 | 33db8d6655b9 |
15 | 18104cbbe021 |
hex | c192ac763ef |
13302231426031 has 2 divisors, whose sum is σ = 13302231426032. Its totient is φ = 13302231426030.
The previous prime is 13302231426023. The next prime is 13302231426053. The reversal of 13302231426031 is 13062413220331.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13302231426031 - 23 = 13302231426023 is a prime.
It is a super-2 number, since 2×133022314260312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13302231425984 and 13302231426002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13302231429031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6651115713015 + 6651115713016.
It is an arithmetic number, because the mean of its divisors is an integer number (6651115713016).
Almost surely, 213302231426031 is an apocalyptic number.
13302231426031 is a deficient number, since it is larger than the sum of its proper divisors (1).
13302231426031 is an equidigital number, since it uses as much as digits as its factorization.
13302231426031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15552, while the sum is 31.
Adding to 13302231426031 its reverse (13062413220331), we get a palindrome (26364644646362).
The spelling of 13302231426031 in words is "thirteen trillion, three hundred two billion, two hundred thirty-one million, four hundred twenty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •