Base | Representation |
---|---|
bin | 11001000011111010101010… |
… | …100111011010110010110000 |
3 | 112110020221220010201110020210 |
4 | 121003322222213122302300 |
5 | 103421322200140210112 |
6 | 1030230302440304120 |
7 | 32134104053066334 |
oct | 3103725247326260 |
9 | 473227803643223 |
10 | 110220313210032 |
11 | 32135199407783 |
12 | 10441527a72040 |
13 | 4966966b3ca2c |
14 | 1d30997b597c4 |
15 | cb213b170b3c |
hex | 643eaa9dacb0 |
110220313210032 has 40 divisors (see below), whose sum is σ = 284847426772480. Its totient is φ = 36725702126400.
The previous prime is 110220313209997. The next prime is 110220313210057. The reversal of 110220313210032 is 230012313022011.
It is a junction number, because it is equal to n+sod(n) for n = 110220313209990 and 110220313210008.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 449947432 + ... + 450192327.
It is an arithmetic number, because the mean of its divisors is an integer number (7121185669312).
Almost surely, 2110220313210032 is an apocalyptic number.
110220313210032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110220313210032 is an abundant number, since it is smaller than the sum of its proper divisors (174627113562448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110220313210032 is a wasteful number, since it uses less digits than its factorization.
110220313210032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 900142321 (or 900142315 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 110220313210032 its reverse (230012313022011), we get a palindrome (340232626232043).
The spelling of 110220313210032 in words is "one hundred ten trillion, two hundred twenty billion, three hundred thirteen million, two hundred ten thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •