Base | Representation |
---|---|
bin | 10111000110011110… |
… | …11111000101010100 |
3 | 1012000100100022200200 |
4 | 23203033133011110 |
5 | 200400010001400 |
6 | 5410402540500 |
7 | 616225564005 |
oct | 134317370524 |
9 | 35010308620 |
10 | 12402422100 |
11 | 5294931322 |
12 | 24a1667730 |
13 | 1228643703 |
14 | 8592531ac |
15 | 4c8c61b00 |
hex | 2e33df154 |
12402422100 has 108 divisors (see below), whose sum is σ = 39822985020. Its totient is φ = 3226636800.
The previous prime is 12402422093. The next prime is 12402422111. The reversal of 12402422100 is 122420421.
12402422100 is a `hidden beast` number, since 1 + 240 + 2 + 422 + 1 + 0 + 0 = 666.
It can be written as a sum of positive squares in 6 ways, for example, as 146603664 + 12255818436 = 12108^2 + 110706^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
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 35 ways as a sum of consecutive naturals, for example, 131155 + ... + 204954.
Almost surely, 212402422100 is an apocalyptic number.
12402422100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12402422100 is an abundant number, since it is smaller than the sum of its proper divisors (27420562920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12402422100 is a wasteful number, since it uses less digits than its factorization.
12402422100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336170 (or 336160 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 12402422100 its reverse (122420421), we get a palindrome (12524842521).
The spelling of 12402422100 in words is "twelve billion, four hundred two million, four hundred twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •