Base | Representation |
---|---|
bin | 110011101111000110… |
… | …0111000001000100010 |
3 | 101121202220012110100200 |
4 | 1213132030320020202 |
5 | 3310014114200002 |
6 | 123012315330030 |
7 | 11012133160665 |
oct | 1473614701042 |
9 | 347686173320 |
10 | 111102100002 |
11 | 4313326a163 |
12 | 19647a50916 |
13 | a62793469a |
14 | 553d70b6dc |
15 | 2d53c45b1c |
hex | 19de338222 |
111102100002 has 12 divisors (see below), whose sum is σ = 240721216710. Its totient is φ = 37034033328.
The previous prime is 111102099947. The next prime is 111102100003. The reversal of 111102100002 is 200001201111.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 91023493401 + 20078606601 = 301701^2 + 141699^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 (111102100003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3086169427 + ... + 3086169462.
Almost surely, 2111102100002 is an apocalyptic number.
111102100002 is an abundant number, since it is smaller than the sum of its proper divisors (129619116708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111102100002 is a wasteful number, since it uses less digits than its factorization.
111102100002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6172338897 (or 6172338894 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 111102100002 its reverse (200001201111), we get a palindrome (311103301113).
It can be divided in two parts, 11110 and 2100002, that added together give a palindrome (2111112).
The spelling of 111102100002 in words is "one hundred eleven billion, one hundred two million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •