Base | Representation |
---|---|
bin | 11001000011110011000111… |
… | …101100011001011110001000 |
3 | 112110020011222111012122011111 |
4 | 121003303013230121132020 |
5 | 103421204102021320013 |
6 | 1030222442452340104 |
7 | 32133366222340534 |
oct | 3103630754313610 |
9 | 473204874178144 |
10 | 110212211120008 |
11 | 32131810a50608 |
12 | 1043ba46614634 |
13 | 4965c75403a1a |
14 | 1d30429ab8bc4 |
15 | cb1d14c0b73d |
hex | 643cc7b19788 |
110212211120008 has 8 divisors (see below), whose sum is σ = 206647895850030. Its totient is φ = 55106105560000.
The previous prime is 110212211119961. The next prime is 110212211120147. The reversal of 110212211120008 is 800021112212011.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 86637709811844 + 23574501308164 = 9307938^2 + 4855358^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×1102122111200082 (a number of 29 digits) contains 22 as substring.
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 as a sum of consecutive naturals, namely, 6888263194993 + ... + 6888263195008.
Almost surely, 2110212211120008 is an apocalyptic number.
It is an amenable number.
110212211120008 is a deficient number, since it is larger than the sum of its proper divisors (96435684730022).
110212211120008 is a wasteful number, since it uses less digits than its factorization.
110212211120008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13776526390007 (or 13776526390003 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 22.
Adding to 110212211120008 its reverse (800021112212011), we get a palindrome (910233323332019).
The spelling of 110212211120008 in words is "one hundred ten trillion, two hundred twelve billion, two hundred eleven million, one hundred twenty thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •