Base | Representation |
---|---|
bin | 10010101111010100… |
… | …010010010110101001 |
3 | 1220221021120212110011 |
4 | 102233110102112221 |
5 | 312202011400131 |
6 | 13124335051521 |
7 | 1311423243535 |
oct | 225724222651 |
9 | 56837525404 |
10 | 20121200041 |
11 | 8595990448 |
12 | 3a96670ba1 |
13 | 1b88831b37 |
14 | d8c434bc5 |
15 | 7cb70c0b1 |
hex | 4af5125a9 |
20121200041 has 4 divisors (see below), whose sum is σ = 20135584000. Its totient is φ = 20106816084.
The previous prime is 20121199997. The next prime is 20121200053. The reversal of 20121200041 is 14000212102.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20121200041 - 217 = 20121068969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20121199994 and 20121200030.
It is not an unprimeable number, because it can be changed into a prime (20121209041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7189881 + ... + 7192678.
It is an arithmetic number, because the mean of its divisors is an integer number (5033896000).
Almost surely, 220121200041 is an apocalyptic number.
It is an amenable number.
20121200041 is a deficient number, since it is larger than the sum of its proper divisors (14383959).
20121200041 is a wasteful number, since it uses less digits than its factorization.
20121200041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14383958.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20121200041 its reverse (14000212102), we get a palindrome (34121412143).
The spelling of 20121200041 in words is "twenty billion, one hundred twenty-one million, two hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •