Base | Representation |
---|---|
bin | 10100111000101101… |
… | …11101101101010100 |
3 | 1001221110121120221120 |
4 | 22130112331231110 |
5 | 140431034401322 |
6 | 5052401443540 |
7 | 544605425544 |
oct | 123426755524 |
9 | 31843546846 |
10 | 11213200212 |
11 | 4834617315 |
12 | 220b3405b0 |
13 | 1099154016 |
14 | 78532b324 |
15 | 459654a5c |
hex | 29c5bdb54 |
11213200212 has 48 divisors (see below), whose sum is σ = 27334285440. Its totient is φ = 3570956928.
The previous prime is 11213200183. The next prime is 11213200231. The reversal of 11213200212 is 21200231211.
It is a junction number, because it is equal to n+sod(n) for n = 11213200191 and 11213200200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 211614 + ... + 259242.
It is an arithmetic number, because the mean of its divisors is an integer number (569464280).
Almost surely, 211213200212 is an apocalyptic number.
11213200212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11213200212 is an abundant number, since it is smaller than the sum of its proper divisors (16121085228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11213200212 is a wasteful number, since it uses less digits than its factorization.
11213200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48512 (or 48510 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11213200212 its reverse (21200231211), we get a palindrome (32413431423).
The spelling of 11213200212 in words is "eleven billion, two hundred thirteen million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •