Base | Representation |
---|---|
bin | 11001011110001001101111… |
… | …000110111101111111001101 |
3 | 112200122022110111101020111002 |
4 | 121132021233012331333031 |
5 | 104140342003441041023 |
6 | 1034130425333110045 |
7 | 32411260232312612 |
oct | 3136115706757715 |
9 | 480568414336432 |
10 | 112023201112013 |
11 | 3276a855652914 |
12 | 10692a1b488325 |
13 | 4a6798647b179 |
14 | 1d93d47cb0509 |
15 | ce3ea94c8b28 |
hex | 65e26f1bdfcd |
112023201112013 has 2 divisors, whose sum is σ = 112023201112014. Its totient is φ = 112023201112012.
The previous prime is 112023201111977. The next prime is 112023201112019. The reversal of 112023201112013 is 310211102320211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100929891753769 + 11093309358244 = 10046387^2 + 3330662^2 .
It is a cyclic number.
It is not a de Polignac number, because 112023201112013 - 26 = 112023201111949 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112023201112019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56011600556006 + 56011600556007.
It is an arithmetic number, because the mean of its divisors is an integer number (56011600556007).
Almost surely, 2112023201112013 is an apocalyptic number.
It is an amenable number.
112023201112013 is a deficient number, since it is larger than the sum of its proper divisors (1).
112023201112013 is an equidigital number, since it uses as much as digits as its factorization.
112023201112013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 112023201112013 its reverse (310211102320211), we get a palindrome (422234303432224).
The spelling of 112023201112013 in words is "one hundred twelve trillion, twenty-three billion, two hundred one million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •