Base | Representation |
---|---|
bin | 10100101100101001… |
… | …11011000111011010 |
3 | 1001200102012012010000 |
4 | 22112110323013122 |
5 | 140224133031020 |
6 | 5034344433430 |
7 | 542236313214 |
oct | 122624730732 |
9 | 31612165100 |
10 | 11112002010 |
11 | 479248763a |
12 | 21a1478876 |
13 | 10811b1025 |
14 | 775b075b4 |
15 | 450815090 |
hex | 29653b1da |
11112002010 has 80 divisors (see below), whose sum is σ = 29975692032. Its totient is φ = 2953605600.
The previous prime is 11112001997. The next prime is 11112002021. The reversal of 11112002010 is 1020021111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11112001983 and 11112002001.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 229855 + ... + 273965.
Almost surely, 211112002010 is an apocalyptic number.
11112002010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11112002010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14987846016).
11112002010 is an abundant number, since it is smaller than the sum of its proper divisors (18863690022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112002010 is a wasteful number, since it uses less digits than its factorization.
11112002010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44441 (or 44432 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11112002010 its reverse (1020021111), we get a palindrome (12132023121).
The spelling of 11112002010 in words is "eleven billion, one hundred twelve million, two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •