Base | Representation |
---|---|
bin | 11001000011100111110001… |
… | …000111001111101111010010 |
3 | 112110012000111221120120112212 |
4 | 121003213301013033233102 |
5 | 103421004120401401002 |
6 | 1030213105114352122 |
7 | 32132455153145000 |
oct | 3103476107175722 |
9 | 473160457516485 |
10 | 110200021122002 |
11 | 32127626018699 |
12 | 1043960412b642 |
13 | 4964a81aa7656 |
14 | 1d2d9d0b5da70 |
15 | cb184e95a352 |
hex | 6439f11cfbd2 |
110200021122002 has 32 divisors (see below), whose sum is σ = 201151008288000. Its totient is φ = 45175163931744.
The previous prime is 110200021122001. The next prime is 110200021122127. The reversal of 110200021122002 is 200221120002011.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (110200021122001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3492189227 + ... + 3492220782.
It is an arithmetic number, because the mean of its divisors is an integer number (6285969009000).
Almost surely, 2110200021122002 is an apocalyptic number.
110200021122002 is a deficient number, since it is larger than the sum of its proper divisors (90950987165998).
110200021122002 is an equidigital number, since it uses as much as digits as its factorization.
110200021122002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6984410055 (or 6984410041 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 110200021122002 its reverse (200221120002011), we get a palindrome (310421141124013).
The spelling of 110200021122002 in words is "one hundred ten trillion, two hundred billion, twenty-one million, one hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •