Base | Representation |
---|---|
bin | 1011110101011010010101… |
… | …1010011100010111001001 |
3 | 1201001221211202111101212201 |
4 | 2331112211122130113021 |
5 | 3201143022131042022 |
6 | 43401423023440201 |
7 | 2512050134342425 |
oct | 275264532342711 |
9 | 51057752441781 |
10 | 13012231112137 |
11 | 4167502264334 |
12 | 1561a35a56061 |
13 | 73508197b48a |
14 | 32db1c603b85 |
15 | 17872835a127 |
hex | bd5a569c5c9 |
13012231112137 has 2 divisors, whose sum is σ = 13012231112138. Its totient is φ = 13012231112136.
The previous prime is 13012231112093. The next prime is 13012231112141. The reversal of 13012231112137 is 73121113221031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12987691576336 + 24539535801 = 3603844^2 + 156651^2 .
It is a cyclic number.
It is not a de Polignac number, because 13012231112137 - 231 = 13010083628489 is a prime.
It is a super-2 number, since 2×130122311121372 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13012235112137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6506115556068 + 6506115556069.
It is an arithmetic number, because the mean of its divisors is an integer number (6506115556069).
Almost surely, 213012231112137 is an apocalyptic number.
It is an amenable number.
13012231112137 is a deficient number, since it is larger than the sum of its proper divisors (1).
13012231112137 is an equidigital number, since it uses as much as digits as its factorization.
13012231112137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 28.
Adding to 13012231112137 its reverse (73121113221031), we get a palindrome (86133344333168).
The spelling of 13012231112137 in words is "thirteen trillion, twelve billion, two hundred thirty-one million, one hundred twelve thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •