Base | Representation |
---|---|
bin | 11001000011100111110000… |
… | …100000101000110010101010 |
3 | 112110012000111020112101011000 |
4 | 121003213300200220302222 |
5 | 103421004110304013002 |
6 | 1030213104113415430 |
7 | 32132455001132466 |
oct | 3103476040506252 |
9 | 473160436471130 |
10 | 110200011001002 |
11 | 3212762033562a |
12 | 1043960086a576 |
13 | 4964a7c9729b0 |
14 | 1d2d9cd6874a6 |
15 | cb184db0b61c |
hex | 6439f0828caa |
110200011001002 has 64 divisors (see below), whose sum is σ = 263833168556160. Its totient is φ = 33893983999872.
The previous prime is 110200011000953. The next prime is 110200011001123. The reversal of 110200011001002 is 200100110002011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 30002748 + ... + 33474839.
It is an arithmetic number, because the mean of its divisors is an integer number (4122393258690).
Almost surely, 2110200011001002 is an apocalyptic number.
110200011001002 is an abundant number, since it is smaller than the sum of its proper divisors (153633157555158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110200011001002 is a wasteful number, since it uses less digits than its factorization.
110200011001002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63480084 (or 63480078 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110200011001002 its reverse (200100110002011), we get a palindrome (310300121003013).
The spelling of 110200011001002 in words is "one hundred ten trillion, two hundred billion, eleven million, one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •