Base | Representation |
---|---|
bin | 11001000011111010100011… |
… | …111111101001101110000000 |
3 | 112110020221121101200121021101 |
4 | 121003322203333221232000 |
5 | 103421321433220401422 |
6 | 1030230243431304144 |
7 | 32134101233624005 |
oct | 3103724377515600 |
9 | 473227541617241 |
10 | 110220202122112 |
11 | 32135141732785 |
12 | 104414b681b054 |
13 | 4966949b16434 |
14 | 1d309870bd8ac |
15 | cb213152ac27 |
hex | 643ea3fe9b80 |
110220202122112 has 32 divisors (see below), whose sum is σ = 219628753711200. Its totient is φ = 55097691386880.
The previous prime is 110220202122101. The next prime is 110220202122113. The reversal of 110220202122112 is 211221202022011.
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 110220202122112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110220202122113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 96379912 + ... + 97516807.
It is an arithmetic number, because the mean of its divisors is an integer number (6863398553475).
Almost surely, 2110220202122112 is an apocalyptic number.
It is an amenable number.
110220202122112 is a deficient number, since it is larger than the sum of its proper divisors (109408551589088).
110220202122112 is an equidigital number, since it uses as much as digits as its factorization.
110220202122112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193901174 (or 193901162 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 110220202122112 its reverse (211221202022011), we get a palindrome (321441404144123).
The spelling of 110220202122112 in words is "one hundred ten trillion, two hundred twenty billion, two hundred two million, one hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •