Base | Representation |
---|---|
bin | 110011010001100101… |
… | …1111100101111101010 |
3 | 101112012220011012212100 |
4 | 1212203023330233222 |
5 | 3301002133013002 |
6 | 122330150154230 |
7 | 10645451364663 |
oct | 1464313745752 |
9 | 345186135770 |
10 | 110112001002 |
11 | 42775399123 |
12 | 19410352976 |
13 | a4ca782ca3 |
14 | 548801a36a |
15 | 2ce6d6d11c |
hex | 19a32fcbea |
110112001002 has 12 divisors (see below), whose sum is σ = 238576002210. Its totient is φ = 36704000328.
The previous prime is 110112000997. The next prime is 110112001003. The reversal of 110112001002 is 200100211011.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 74507707521 + 35604293481 = 272961^2 + 188691^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (110112001003) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3058666677 + ... + 3058666712.
Almost surely, 2110112001002 is an apocalyptic number.
110112001002 is an abundant number, since it is smaller than the sum of its proper divisors (128464001208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110112001002 is a wasteful number, since it uses less digits than its factorization.
110112001002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6117333397 (or 6117333394 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110112001002 its reverse (200100211011), we get a palindrome (310212212013).
It can be divided in two parts, 11011 and 2001002, that multiplied together give a palindrome (22033033022).
The spelling of 110112001002 in words is "one hundred ten billion, one hundred twelve million, one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.942 sec. • engine limits •