Base | Representation |
---|---|
bin | 11001000000101101100101… |
… | …011110110101100001010100 |
3 | 112102110220111210112101001000 |
4 | 121000231211132311201110 |
5 | 103404220211130001322 |
6 | 1025541204121303300 |
7 | 32112150161512065 |
oct | 3100554536654124 |
9 | 472426453471030 |
10 | 110000110000212 |
11 | 3205a86a441a63 |
12 | 10406912334b30 |
13 | 494bc73006943 |
14 | 1d240687b656c |
15 | cab54e1e03ac |
hex | 640b657b5854 |
110000110000212 has 24 divisors (see below), whose sum is σ = 285185470371200. Its totient is φ = 36666703333368.
The previous prime is 110000110000201. The next prime is 110000110000271. The reversal of 110000110000212 is 212000011000011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 110000110000194 and 110000110000203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 509259768412 + ... + 509259768627.
Almost surely, 2110000110000212 is an apocalyptic number.
110000110000212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110000110000212 is an abundant number, since it is smaller than the sum of its proper divisors (175185360370988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110000110000212 is a wasteful number, since it uses less digits than its factorization.
110000110000212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1018519537052 (or 1018519537044 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110000110000212 its reverse (212000011000011), we get a palindrome (322000121000223).
The spelling of 110000110000212 in words is "one hundred ten trillion, one hundred ten million, two hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •