Base | Representation |
---|---|
bin | 110011101111010101… |
… | …1000101101110100010 |
3 | 101121210110002211120000 |
4 | 1213132223011232202 |
5 | 3310023131120002 |
6 | 123013201200430 |
7 | 11012260405242 |
oct | 1473653055642 |
9 | 347713084500 |
10 | 111110020002 |
11 | 43137789613 |
12 | 1964a630116 |
13 | a629478587 |
14 | 55407adb22 |
15 | 2d547ac61c |
hex | 19deac5ba2 |
111110020002 has 80 divisors (see below), whose sum is σ = 253639948320. Its totient is φ = 36344028672.
The previous prime is 111110019961. The next prime is 111110020003. The reversal of 111110020002 is 200020011111.
It is a happy number.
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 (111110020003) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 5504893 + ... + 5525039.
It is an arithmetic number, because the mean of its divisors is an integer number (3170499354).
Almost surely, 2111110020002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 111110020002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126819974160).
111110020002 is an abundant number, since it is smaller than the sum of its proper divisors (142529928318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111110020002 is a wasteful number, since it uses less digits than its factorization.
111110020002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20797 (or 20788 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 111110020002 its reverse (200020011111), we get a palindrome (311130031113).
The spelling of 111110020002 in words is "one hundred eleven billion, one hundred ten million, twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •