Base | Representation |
---|---|
bin | 11001000010010101110100… |
… | …011100100100001110010101 |
3 | 112102212121101201011021011201 |
4 | 121002111310130210032111 |
5 | 103413033414213304023 |
6 | 1030104433544032501 |
7 | 32123221520565433 |
oct | 3102256434441625 |
9 | 472777351137151 |
10 | 110112030213013 |
11 | 320a32824933a4 |
12 | 10424548162731 |
13 | 495969b29362a |
14 | 1d29644a05d53 |
15 | cae3eeb89bad |
hex | 642574724395 |
110112030213013 has 2 divisors, whose sum is σ = 110112030213014. Its totient is φ = 110112030213012.
The previous prime is 110112030213011. The next prime is 110112030213041. The reversal of 110112030213013 is 310312030211011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77987143847089 + 32124886365924 = 8831033^2 + 5667882^2 .
It is a cyclic number.
It is not a de Polignac number, because 110112030213013 - 21 = 110112030213011 is a prime.
Together with 110112030213011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110112030213011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55056015106506 + 55056015106507.
It is an arithmetic number, because the mean of its divisors is an integer number (55056015106507).
Almost surely, 2110112030213013 is an apocalyptic number.
It is an amenable number.
110112030213013 is a deficient number, since it is larger than the sum of its proper divisors (1).
110112030213013 is an equidigital number, since it uses as much as digits as its factorization.
110112030213013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 110112030213013 its reverse (310312030211011), we get a palindrome (420424060424024).
The spelling of 110112030213013 in words is "one hundred ten trillion, one hundred twelve billion, thirty million, two hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •