Base | Representation |
---|---|
bin | 11001000011110010111011… |
… | …111001110010000011111000 |
3 | 112110020011110200222102212220 |
4 | 121003302323321302003320 |
5 | 103421203200401131013 |
6 | 1030222411104404040 |
7 | 32133361301041632 |
oct | 3103627371620370 |
9 | 473204420872786 |
10 | 110212013302008 |
11 | 3213171a318a62 |
12 | 1043b9b0316620 |
13 | 4965c43431957 |
14 | 1d3040b703a52 |
15 | cb1d02683b23 |
hex | 643cbbe720f8 |
110212013302008 has 16 divisors (see below), whose sum is σ = 275530033255080. Its totient is φ = 36737337767328.
The previous prime is 110212013301883. The next prime is 110212013302009. The reversal of 110212013302008 is 800203310212011.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 4592167220917 = 110212013302008 / (1 + 1 + 0 + 2 + 1 + 2 + 0 + 1 + 3 + 3 + 0 + 2 + 0 + 0 + 8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110212013302009) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2296083610435 + ... + 2296083610482.
Almost surely, 2110212013302008 is an apocalyptic number.
It is an amenable number.
110212013302008 is an abundant number, since it is smaller than the sum of its proper divisors (165318019953072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110212013302008 is a wasteful number, since it uses less digits than its factorization.
110212013302008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4592167220926 (or 4592167220922 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 110212013302008 its reverse (800203310212011), we get a palindrome (910415323514019).
The spelling of 110212013302008 in words is "one hundred ten trillion, two hundred twelve billion, thirteen million, three hundred two thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •