Base | Representation |
---|---|
bin | 110011101111010111… |
… | …0110111011011010010 |
3 | 101121210111222010120200 |
4 | 1213132232313123102 |
5 | 3310023404310002 |
6 | 123013234320030 |
7 | 11012302000446 |
oct | 1473656673322 |
9 | 347714863520 |
10 | 111111010002 |
11 | 431382a53a3 |
12 | 1964aa29016 |
13 | a629734085 |
14 | 554098a826 |
15 | 2d54905b1c |
hex | 19debb76d2 |
111111010002 has 48 divisors (see below), whose sum is σ = 249420600000. Its totient is φ = 35705490912.
The previous prime is 111111009991. The next prime is 111111010033. The reversal of 111111010002 is 200010111111.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 182499 + ... + 505497.
It is an arithmetic number, because the mean of its divisors is an integer number (5196262500).
Almost surely, 2111111010002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 111111010002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124710300000).
111111010002 is an abundant number, since it is smaller than the sum of its proper divisors (138309589998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111111010002 is a wasteful number, since it uses less digits than its factorization.
111111010002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 323695 (or 323692 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 111111010002 its reverse (200010111111), we get a palindrome (311121121113).
The spelling of 111111010002 in words is "one hundred eleven billion, one hundred eleven million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •