Base | Representation |
---|---|
bin | 10100111000100100… |
… | …11001001011100100 |
3 | 1001221101100201100002 |
4 | 22130102121023210 |
5 | 140430233031040 |
6 | 5052320040432 |
7 | 544562305352 |
oct | 123422311344 |
9 | 31841321302 |
10 | 11212002020 |
11 | 483397907a |
12 | 220aa63118 |
13 | 1098b2482b |
14 | 7850d87d2 |
15 | 4594b9a15 |
hex | 29c4992e4 |
11212002020 has 12 divisors (see below), whose sum is σ = 23545204284. Its totient is φ = 4484800800.
The previous prime is 11212002007. The next prime is 11212002023. The reversal of 11212002020 is 2020021211.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 7974847204 + 3237154816 = 89302^2 + 56896^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11212001992 and 11212002010.
It is not an unprimeable number, because it can be changed into a prime (11212002023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 280300031 + ... + 280300070.
It is an arithmetic number, because the mean of its divisors is an integer number (1962100357).
Almost surely, 211212002020 is an apocalyptic number.
11212002020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11212002020 is an abundant number, since it is smaller than the sum of its proper divisors (12333202264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11212002020 is a wasteful number, since it uses less digits than its factorization.
11212002020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560600110 (or 560600108 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 11212002020 its reverse (2020021211), we get a palindrome (13232023231).
The spelling of 11212002020 in words is "eleven billion, two hundred twelve million, two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •