Base | Representation |
---|---|
bin | 11001000000111000101010… |
… | …110010001010000011101100 |
3 | 112102112001020010200122102212 |
4 | 121000320222302022003230 |
5 | 103404414044042024322 |
6 | 1025550453022105552 |
7 | 32113051111005206 |
oct | 3100705262120354 |
9 | 472461203618385 |
10 | 110012010111212 |
11 | 32064916778540 |
12 | 1040909371b2b8 |
13 | 495011b566341 |
14 | 1d24877031776 |
15 | cab9e8cce0e2 |
hex | 640e2ac8a0ec |
110012010111212 has 96 divisors (see below), whose sum is σ = 219257188899840. Its totient is φ = 47862700830720.
The previous prime is 110012010111109. The next prime is 110012010111257. The reversal of 110012010111212 is 212111010210011.
110012010111212 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1100120101112122 (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 31 ways as a sum of consecutive naturals, for example, 21212438 + ... + 25884194.
It is an arithmetic number, because the mean of its divisors is an integer number (2283929051040).
Almost surely, 2110012010111212 is an apocalyptic number.
It is an amenable number.
110012010111212 is a deficient number, since it is larger than the sum of its proper divisors (109245178788628).
110012010111212 is a wasteful number, since it uses less digits than its factorization.
110012010111212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4672071 (or 4672069 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110012010111212 its reverse (212111010210011), we get a palindrome (322123020321223).
The spelling of 110012010111212 in words is "one hundred ten trillion, twelve billion, ten million, one hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •