Base | Representation |
---|---|
bin | 1101011100111011010… |
… | …0000001110010101101 |
3 | 211002111222002101220022 |
4 | 3113032310001302231 |
5 | 12241244332341023 |
6 | 254100043331525 |
7 | 22460643122216 |
oct | 3271664016255 |
9 | 732458071808 |
10 | 231103012013 |
11 | 8a012697505 |
12 | 38957b20ba5 |
13 | 18a4007abb3 |
14 | b284c1040d |
15 | 6028d2b7c8 |
hex | 35ced01cad |
231103012013 has 2 divisors, whose sum is σ = 231103012014. Its totient is φ = 231103012012.
The previous prime is 231103011947. The next prime is 231103012039. The reversal of 231103012013 is 310210301132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 186055920964 + 45047091049 = 431342^2 + 212243^2 .
It is a cyclic number.
It is not a de Polignac number, because 231103012013 - 210 = 231103010989 is a prime.
It is a super-2 number, since 2×2311030120132 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 231103011982 and 231103012000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231103012043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115551506006 + 115551506007.
It is an arithmetic number, because the mean of its divisors is an integer number (115551506007).
Almost surely, 2231103012013 is an apocalyptic number.
It is an amenable number.
231103012013 is a deficient number, since it is larger than the sum of its proper divisors (1).
231103012013 is an equidigital number, since it uses as much as digits as its factorization.
231103012013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 231103012013 its reverse (310210301132), we get a palindrome (541313313145).
The spelling of 231103012013 in words is "two hundred thirty-one billion, one hundred three million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •