Base | Representation |
---|---|
bin | 11101010001111011110… |
… | …001001111010110001001 |
3 | 21010100122012000121110202 |
4 | 131101323301033112021 |
5 | 230431311011400014 |
6 | 4140204500221545 |
7 | 265241145001424 |
oct | 35217361172611 |
9 | 7110565017422 |
10 | 2012121200009 |
11 | 706376a63858 |
12 | 285b6739a8b5 |
13 | 11798585307b |
14 | 6d55c61a9bb |
15 | 375171de3de |
hex | 1d47bc4f589 |
2012121200009 has 4 divisors (see below), whose sum is σ = 2019601204740. Its totient is φ = 2004641195280.
The previous prime is 2012121199969. The next prime is 2012121200039. The reversal of 2012121200009 is 9000021212102.
It is a happy number.
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 716303244409 + 1295817955600 = 846347^2 + 1138340^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012121200009 - 228 = 2011852764553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2012121200039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3740001962 + ... + 3740002499.
It is an arithmetic number, because the mean of its divisors is an integer number (504900301185).
Almost surely, 22012121200009 is an apocalyptic number.
It is an amenable number.
2012121200009 is a deficient number, since it is larger than the sum of its proper divisors (7480004731).
2012121200009 is an equidigital number, since it uses as much as digits as its factorization.
2012121200009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7480004730.
The product of its (nonzero) digits is 144, while the sum is 20.
The spelling of 2012121200009 in words is "two trillion, twelve billion, one hundred twenty-one million, two hundred thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •