Base | Representation |
---|---|
bin | 10110010111111101… |
… | …00111000001011000 |
3 | 1011000010221000212211 |
4 | 23023332213001120 |
5 | 144100100402300 |
6 | 5303541244504 |
7 | 603446232301 |
oct | 131376470130 |
9 | 34003830784 |
10 | 12012122200 |
11 | 5104591221 |
12 | 23b2a03734 |
13 | 119581a320 |
14 | 81d4957a8 |
15 | 4a48674ba |
hex | 2cbfa7058 |
12012122200 has 96 divisors (see below), whose sum is σ = 30147289200. Its totient is φ = 4424808960.
The previous prime is 12012122147. The next prime is 12012122201. The reversal of 12012122200 is 222121021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12012122201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1146586 + ... + 1157014.
Almost surely, 212012122200 is an apocalyptic number.
12012122200 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 12012122200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15073644600).
12012122200 is an abundant number, since it is smaller than the sum of its proper divisors (18135167000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12012122200 is a wasteful number, since it uses less digits than its factorization.
12012122200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10901 (or 10892 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 12012122200 its reverse (222121021), we get a palindrome (12234243221).
The spelling of 12012122200 in words is "twelve billion, twelve million, one hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •