Base | Representation |
---|---|
bin | 11001000000101111011101… |
… | …010110100100111110010000 |
3 | 112102111002200221202212221210 |
4 | 121000233131112210332100 |
5 | 103404233321000214300 |
6 | 1025542135442220120 |
7 | 32112251051550216 |
oct | 3100573526447620 |
9 | 472432627685853 |
10 | 110002121101200 |
11 | 32060701680999 |
12 | 10407193954640 |
13 | 494c203869a23 |
14 | 1d241b9920cb6 |
15 | cab61aa47050 |
hex | 640bdd5a4f90 |
110002121101200 has 120 divisors (see below), whose sum is σ = 352419117452128. Its totient is φ = 29330098237440.
The previous prime is 110002121101157. The next prime is 110002121101237. The reversal of 110002121101200 is 2101121200011.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3332832 + ... + 15202368.
Almost surely, 2110002121101200 is an apocalyptic number.
110002121101200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110002121101200 is an abundant number, since it is smaller than the sum of its proper divisors (242416996350928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110002121101200 is a wasteful number, since it uses less digits than its factorization.
110002121101200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11877281 (or 11877270 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110002121101200 its reverse (2101121200011), we get a palindrome (112103242301211).
The spelling of 110002121101200 in words is "one hundred ten trillion, two billion, one hundred twenty-one million, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •