Base | Representation |
---|---|
bin | 11001000001000001000010… |
… | …101100001000110110110000 |
3 | 112102112220102201212021110210 |
4 | 121001001002230020312300 |
5 | 103410041002241334300 |
6 | 1025554541122424120 |
7 | 32113516654224261 |
oct | 3101010254106660 |
9 | 472486381767423 |
10 | 110021001121200 |
11 | 3206870a989404 |
12 | 1040a982802040 |
13 | 4950c221b96b0 |
14 | 1d2508b186968 |
15 | cabd732d2050 |
hex | 641042b08db0 |
110021001121200 has 240 divisors, whose sum is σ = 385766283467936. Its totient is φ = 26638123622400.
The previous prime is 110021001121183. The next prime is 110021001121223. The reversal of 110021001121200 is 2121100120011.
It is a tau number, because it is divible by the number of its divisors (240).
It is a super-2 number, since 2×1100210011212002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 56856829 + ... + 58760028.
Almost surely, 2110021001121200 is an apocalyptic number.
110021001121200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110021001121200 is an abundant number, since it is smaller than the sum of its proper divisors (275745282346736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110021001121200 is a wasteful number, since it uses less digits than its factorization.
110021001121200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115616952 (or 115616941 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110021001121200 its reverse (2121100120011), we get a palindrome (112142101241211).
The spelling of 110021001121200 in words is "one hundred ten trillion, twenty-one billion, one million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •