Base | Representation |
---|---|
bin | 11001000010010101111111… |
… | …110100010111000101000010 |
3 | 112102212121220000011020201111 |
4 | 121002111333310113011002 |
5 | 103413034312034000002 |
6 | 1030104504521153534 |
7 | 32123226325341634 |
oct | 3102257764270502 |
9 | 472777800136644 |
10 | 110112221000002 |
11 | 320a33701534a1 |
12 | 104245a002b8aa |
13 | 49596cb973340 |
14 | 1d296620aaa54 |
15 | cae4117c43d7 |
hex | 64257fd17142 |
110112221000002 has 48 divisors (see below), whose sum is σ = 181734735288960. Its totient is φ = 49718759898816.
The previous prime is 110112220999981. The next prime is 110112221000003. The reversal of 110112221000002 is 200000122211011.
It is a super-3 number, since 3×1101122210000023 (a number of 43 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (110112221000003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15253109149 + ... + 15253116367.
It is an arithmetic number, because the mean of its divisors is an integer number (3786140318520).
Almost surely, 2110112221000002 is an apocalyptic number.
110112221000002 is a deficient number, since it is larger than the sum of its proper divisors (71622514288958).
110112221000002 is an frugal number, since it uses more digits than its factorization.
110112221000002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14347 (or 10814 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110112221000002 its reverse (200000122211011), we get a palindrome (310112343211013).
The spelling of 110112221000002 in words is "one hundred ten trillion, one hundred twelve billion, two hundred twenty-one million, two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •