Base | Representation |
---|---|
bin | 11001000000110111101111… |
… | …001111001110010101011111 |
3 | 112102111221122111212111212201 |
4 | 121000313233033032111133 |
5 | 103404410022320113301 |
6 | 1025550205533512331 |
7 | 32113014260354125 |
oct | 3100675717162537 |
9 | 472457574774781 |
10 | 110011011097951 |
11 | 32064453869047 |
12 | 10408a550426a7 |
13 | 494ccbc5b3332 |
14 | 1d247c049d915 |
15 | cab98b245201 |
hex | 640def3ce55f |
110011011097951 has 2 divisors, whose sum is σ = 110011011097952. Its totient is φ = 110011011097950.
The previous prime is 110011011097927. The next prime is 110011011098011. The reversal of 110011011097951 is 159790110110011.
It is a weak prime.
It is an emirp because it is prime and its reverse (159790110110011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110011011097951 - 223 = 110011002709343 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110011011097951.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110011011091951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005505548975 + 55005505548976.
It is an arithmetic number, because the mean of its divisors is an integer number (55005505548976).
Almost surely, 2110011011097951 is an apocalyptic number.
110011011097951 is a deficient number, since it is larger than the sum of its proper divisors (1).
110011011097951 is an equidigital number, since it uses as much as digits as its factorization.
110011011097951 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2835, while the sum is 37.
The spelling of 110011011097951 in words is "one hundred ten trillion, eleven billion, eleven million, ninety-seven thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •