Base | Representation |
---|---|
bin | 10110010110110000… |
… | …00101001011010100 |
3 | 1010222102220220011001 |
4 | 23023120011023110 |
5 | 144040004201400 |
6 | 5302540553044 |
7 | 603264335035 |
oct | 131330051324 |
9 | 33872826131 |
10 | 12002022100 |
11 | 50a9912932 |
12 | 23ab552784 |
13 | 11936c2033 |
14 | 81bdc6a8c |
15 | 4a3a1ea6a |
hex | 2cb6052d4 |
12002022100 has 36 divisors (see below), whose sum is σ = 27576414684. Its totient is φ = 4518407680.
The previous prime is 12002022061. The next prime is 12002022101. The reversal of 12002022100 is 122020021.
It can be written as a sum of positive squares in 6 ways, for example, as 1180197316 + 10821824784 = 34354^2 + 104028^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002022101) 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, 3528307 + ... + 3531706.
It is an arithmetic number, because the mean of its divisors is an integer number (766011519).
Almost surely, 212002022100 is an apocalyptic number.
12002022100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12002022100 is an abundant number, since it is smaller than the sum of its proper divisors (15574392584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12002022100 is a wasteful number, since it uses less digits than its factorization.
12002022100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7060044 (or 7060037 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 12002022100 its reverse (122020021), we get a palindrome (12124042121).
The spelling of 12002022100 in words is "twelve billion, two million, twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •