Base | Representation |
---|---|
bin | 10010101111010101… |
… | …000110001110111101 |
3 | 1220221021222122221112 |
4 | 102233111012032331 |
5 | 312202040200131 |
6 | 13124343411405 |
7 | 1311425120216 |
oct | 225725061675 |
9 | 56837878845 |
10 | 20121412541 |
11 | 859601606a |
12 | 3a96753b65 |
13 | 1b888a7789 |
14 | d8c48c40d |
15 | 7cb75002b |
hex | 4af5463bd |
20121412541 has 4 divisors (see below), whose sum is σ = 20142887772. Its totient is φ = 20099937312.
The previous prime is 20121412537. The next prime is 20121412579. The reversal of 20121412541 is 14521412102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11953048900 + 8168363641 = 109330^2 + 90379^2 .
It is a cyclic number.
It is not a de Polignac number, because 20121412541 - 22 = 20121412537 is a prime.
It is a super-2 number, since 2×201214125412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20121412511) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10736210 + ... + 10738083.
It is an arithmetic number, because the mean of its divisors is an integer number (5035721943).
Almost surely, 220121412541 is an apocalyptic number.
It is an amenable number.
20121412541 is a deficient number, since it is larger than the sum of its proper divisors (21475231).
20121412541 is an equidigital number, since it uses as much as digits as its factorization.
20121412541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21475230.
The product of its (nonzero) digits is 640, while the sum is 23.
Adding to 20121412541 its reverse (14521412102), we get a palindrome (34642824643).
The spelling of 20121412541 in words is "twenty billion, one hundred twenty-one million, four hundred twelve thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •