Base | Representation |
---|---|
bin | 10110010110110001… |
… | …10000101010010100 |
3 | 1010222110020221110210 |
4 | 23023120300222110 |
5 | 144040030401322 |
6 | 5302544445420 |
7 | 603266006232 |
oct | 131330605224 |
9 | 33873227423 |
10 | 12002200212 |
11 | 50a9a24732 |
12 | 23ab619870 |
13 | 1193755122 |
14 | 81c031952 |
15 | 4a3a5770c |
hex | 2cb630a94 |
12002200212 has 36 divisors (see below), whose sum is σ = 29556675456. Its totient is φ = 3790167120.
The previous prime is 12002200211. The next prime is 12002200213. The reversal of 12002200212 is 21200220021.
It is an interprime number because it is at equal distance from previous prime (12002200211) and next prime (12002200213).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002200211) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1380964 + ... + 1389627.
Almost surely, 212002200212 is an apocalyptic number.
12002200212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12002200212 is an abundant number, since it is smaller than the sum of its proper divisors (17554475244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12002200212 is a wasteful number, since it uses less digits than its factorization.
12002200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2770636 (or 2770615 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 12002200212 its reverse (21200220021), we get a palindrome (33202420233).
It can be divided in two parts, 1200220021 and 2, that multiplied together give a palindrome (2400440042).
The spelling of 12002200212 in words is "twelve billion, two million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •