Base | Representation |
---|---|
bin | 11001000010010100000111… |
… | …111101000011000001001100 |
3 | 112102212102200212010102201012 |
4 | 121002110013331003001030 |
5 | 103413021202230324322 |
6 | 1030103533202504352 |
7 | 32123125436251565 |
oct | 3102240775030114 |
9 | 472772625112635 |
10 | 110110210011212 |
11 | 320a2528a90894 |
12 | 1042411a6650b8 |
13 | 495946b14c348 |
14 | 1d29510d9116c |
15 | cae344e90ae2 |
hex | 642507f4304c |
110110210011212 has 24 divisors (see below), whose sum is σ = 193762437507072. Its totient is φ = 54749694256400.
The previous prime is 110110210011199. The next prime is 110110210011229. The reversal of 110110210011212 is 212110012011011.
It is a super-2 number, since 2×1101102100112122 (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 (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20144858 + ... + 25020705.
It is an arithmetic number, because the mean of its divisors is an integer number (8073434896128).
Almost surely, 2110110210011212 is an apocalyptic number.
It is an amenable number.
110110210011212 is a deficient number, since it is larger than the sum of its proper divisors (83652227495860).
110110210011212 is a wasteful number, since it uses less digits than its factorization.
110110210011212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45168949 (or 45168947 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110110210011212 its reverse (212110012011011), we get a palindrome (322220222022223).
The spelling of 110110210011212 in words is "one hundred ten trillion, one hundred ten billion, two hundred ten million, eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •