Base | Representation |
---|---|
bin | 10110100101000011… |
… | …10001101110110101 |
3 | 1011021210200121221010 |
4 | 23102201301232311 |
5 | 144311213120110 |
6 | 5322504342433 |
7 | 606252223500 |
oct | 132241615665 |
9 | 34253617833 |
10 | 12122004405 |
11 | 5160612365 |
12 | 2423774a19 |
13 | 11b2510b94 |
14 | 82dcda137 |
15 | 4ae320020 |
hex | 2d2871bb5 |
12122004405 has 96 divisors (see below), whose sum is σ = 22851072000. Its totient is φ = 5470996608.
The previous prime is 12122004403. The next prime is 12122004407. The reversal of 12122004405 is 50440022121.
It is an interprime number because it is at equal distance from previous prime (12122004403) and next prime (12122004407).
It is not a de Polignac number, because 12122004405 - 21 = 12122004403 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12122004403) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 26181204 + ... + 26181666.
It is an arithmetic number, because the mean of its divisors is an integer number (238032000).
Almost surely, 212122004405 is an apocalyptic number.
12122004405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12122004405 is a deficient number, since it is larger than the sum of its proper divisors (10729067595).
12122004405 is a wasteful number, since it uses less digits than its factorization.
12122004405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 863 (or 856 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 21.
Adding to 12122004405 its reverse (50440022121), we get a palindrome (62562026526).
The spelling of 12122004405 in words is "twelve billion, one hundred twenty-two million, four thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •