Base | Representation |
---|---|
bin | 10110100010101110… |
… | …00100011010001001 |
3 | 1011020102211122022200 |
4 | 23101113010122021 |
5 | 144241204420410 |
6 | 5320524510413 |
7 | 605623605426 |
oct | 132127043211 |
9 | 34212748280 |
10 | 12102420105 |
11 | 5150556396 |
12 | 24190ab409 |
13 | 11ab444a39 |
14 | 82b47cd4d |
15 | 4ac7523c0 |
hex | 2d15c4689 |
12102420105 has 48 divisors (see below), whose sum is σ = 22243403520. Its totient is φ = 6066215424.
The previous prime is 12102420103. The next prime is 12102420107. The reversal of 12102420105 is 50102420121.
It is an interprime number because it is at equal distance from previous prime (12102420103) and next prime (12102420107).
It is not a de Polignac number, because 12102420105 - 21 = 12102420103 is a prime.
It is a super-2 number, since 2×121024201052 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12102420103) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 539034 + ... + 561036.
It is an arithmetic number, because the mean of its divisors is an integer number (463404240).
Almost surely, 212102420105 is an apocalyptic number.
12102420105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12102420105 is a deficient number, since it is larger than the sum of its proper divisors (10140983415).
12102420105 is a wasteful number, since it uses less digits than its factorization.
12102420105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22750 (or 22747 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
Adding to 12102420105 its reverse (50102420121), we get a palindrome (62204840226).
The spelling of 12102420105 in words is "twelve billion, one hundred two million, four hundred twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •