Base | Representation |
---|---|
bin | 11001000011101001111010… |
… | …010100101001000010000111 |
3 | 112110012020110101011210021022 |
4 | 121003221322110221002013 |
5 | 103421023324204041241 |
6 | 1030214125350141355 |
7 | 32132566204555211 |
oct | 3103517224510207 |
9 | 473166411153238 |
10 | 110202323112071 |
11 | 321285a7478923 |
12 | 10439b4705185b |
13 | 496505a998558 |
14 | 1d2db6c7895b1 |
15 | cb1936ac154b |
hex | 643a7a529087 |
110202323112071 has 2 divisors, whose sum is σ = 110202323112072. Its totient is φ = 110202323112070.
The previous prime is 110202323112023. The next prime is 110202323112073. The reversal of 110202323112071 is 170211323202011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110202323112071 - 246 = 39833578934407 is a prime.
Together with 110202323112073, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110202323112071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110202323112073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55101161556035 + 55101161556036.
It is an arithmetic number, because the mean of its divisors is an integer number (55101161556036).
Almost surely, 2110202323112071 is an apocalyptic number.
110202323112071 is a deficient number, since it is larger than the sum of its proper divisors (1).
110202323112071 is an equidigital number, since it uses as much as digits as its factorization.
110202323112071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 26.
Adding to 110202323112071 its reverse (170211323202011), we get a palindrome (280413646314082).
The spelling of 110202323112071 in words is "one hundred ten trillion, two hundred two billion, three hundred twenty-three million, one hundred twelve thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •