Base | Representation |
---|---|
bin | 11001000010011111000110… |
… | …101100010111011000001000 |
3 | 112102220120010112002222122101 |
4 | 121002133012230113120020 |
5 | 103413214324001133000 |
6 | 1030113203131403144 |
7 | 32124023550552142 |
oct | 3102370654273010 |
9 | 472816115088571 |
10 | 110122000021000 |
11 | 320a7529156730 |
12 | 1042646abb34b4 |
13 | 495a5c993c5b6 |
14 | 1d29d0cb49c92 |
15 | cae7d5081e6a |
hex | 6427c6b17608 |
110122000021000 has 128 divisors (see below), whose sum is σ = 281117051953920. Its totient is φ = 40043563200000.
The previous prime is 110122000020941. The next prime is 110122000021049. The reversal of 110122000021000 is 120000221011.
It is a Harshad number since it is a multiple of its sum of digits (10).
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, 1096880805 + ... + 1096981195.
It is an arithmetic number, because the mean of its divisors is an integer number (2196226968390).
Almost surely, 2110122000021000 is an apocalyptic number.
110122000021000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110122000021000 is an abundant number, since it is smaller than the sum of its proper divisors (170995051932920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110122000021000 is a wasteful number, since it uses less digits than its factorization.
110122000021000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200144 (or 200130 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110122000021000 its reverse (120000221011), we get a palindrome (110242000242011).
The spelling of 110122000021000 in words is "one hundred ten trillion, one hundred twenty-two billion, twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •