Base | Representation |
---|---|
bin | 11001000011110010111011… |
… | …000111011011001010011100 |
3 | 112110020011102210010202112102 |
4 | 121003302323013123022130 |
5 | 103421203134011213040 |
6 | 1030222405513424232 |
7 | 32133361050611036 |
oct | 3103627307331234 |
9 | 473204383122472 |
10 | 110212000101020 |
11 | 32131712921954 |
12 | 1043b9a7a0b078 |
13 | 4965c4078c10c |
14 | 1d30409a68c56 |
15 | cb1d01427515 |
hex | 643cbb1db29c |
110212000101020 has 48 divisors (see below), whose sum is σ = 232026853006368. Its totient is φ = 43974013286400.
The previous prime is 110212000101019. The next prime is 110212000101059. The reversal of 110212000101020 is 20101000212011.
It is a junction number, because it is equal to n+sod(n) for n = 110212000100992 and 110212000101010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 564967619 + ... + 565162661.
It is an arithmetic number, because the mean of its divisors is an integer number (4833892770966).
Almost surely, 2110212000101020 is an apocalyptic number.
110212000101020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110212000101020 is an abundant number, since it is smaller than the sum of its proper divisors (121814852905348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110212000101020 is a wasteful number, since it uses less digits than its factorization.
110212000101020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265910 (or 265908 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110212000101020 its reverse (20101000212011), we get a palindrome (130313000313031).
The spelling of 110212000101020 in words is "one hundred ten trillion, two hundred twelve billion, one hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •