Base | Representation |
---|---|
bin | 10100101100100010… |
… | …10100001010000010 |
3 | 1001200100102010102200 |
4 | 22112101110022002 |
5 | 140223412243002 |
6 | 5034312254030 |
7 | 542225263164 |
oct | 122621241202 |
9 | 31610363380 |
10 | 11111056002 |
11 | 47919a0912 |
12 | 21a10a1316 |
13 | 1080c3c567 |
14 | 77593c934 |
15 | 4506c9b1c |
hex | 296454282 |
11111056002 has 12 divisors (see below), whose sum is σ = 24073954710. Its totient is φ = 3703685328.
The previous prime is 11111056001. The next prime is 11111056003. The reversal of 11111056002 is 20065011111.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11111056001) and next prime (11111056003).
It can be written as a sum of positive squares in only one way, i.e., 7867867401 + 3243188601 = 88701^2 + 56949^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 617280889 = 11111056002 / (1 + 1 + 1 + 1 + 1 + 0 + 5 + 6 + 0 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (11111056001) 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, 308640427 + ... + 308640462.
Almost surely, 211111056002 is an apocalyptic number.
11111056002 is an abundant number, since it is smaller than the sum of its proper divisors (12962898708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111056002 is a wasteful number, since it uses less digits than its factorization.
11111056002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 617280897 (or 617280894 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 18.
Adding to 11111056002 its reverse (20065011111), we get a palindrome (31176067113).
The spelling of 11111056002 in words is "eleven billion, one hundred eleven million, fifty-six thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •