Base | Representation |
---|---|
bin | 10110101111110010… |
… | …01000100011110100 |
3 | 1011112002001112220220 |
4 | 23113321020203310 |
5 | 200002233411200 |
6 | 5335441454340 |
7 | 611424254214 |
oct | 132771104364 |
9 | 34462045826 |
10 | 12212013300 |
11 | 51a73aa383 |
12 | 24499413b0 |
13 | 11c8066b96 |
14 | 83bc4a244 |
15 | 4b719e4a0 |
hex | 2d7e488f4 |
12212013300 has 144 divisors (see below), whose sum is σ = 36987965952. Its totient is φ = 3104956800.
The previous prime is 12212013293. The next prime is 12212013367. The reversal of 12212013300 is 331021221.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 12212013300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2281227 + ... + 2286573.
Almost surely, 212212013300 is an apocalyptic number.
12212013300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12212013300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18493982976).
12212013300 is an abundant number, since it is smaller than the sum of its proper divisors (24775952652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12212013300 is a wasteful number, since it uses less digits than its factorization.
12212013300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5718 (or 5711 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 12212013300 its reverse (331021221), we get a palindrome (12543034521).
The spelling of 12212013300 in words is "twelve billion, two hundred twelve million, thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •