Base | Representation |
---|---|
bin | 11101010001111010100… |
… | …100010000110101001001 |
3 | 21010100120210001102002002 |
4 | 131101322210100311021 |
5 | 230431240330133001 |
6 | 4140202455520345 |
7 | 265240511325461 |
oct | 35217244206511 |
9 | 7110523042062 |
10 | 2012101021001 |
11 | 706366630a95 |
12 | 285b606890b5 |
13 | 117981609326 |
14 | 6d559a86ba1 |
15 | 3751555546b |
hex | 1d47a910d49 |
2012101021001 has 4 divisors (see below), whose sum is σ = 2099583674112. Its totient is φ = 1924618367892.
The previous prime is 2012101020959. The next prime is 2012101021097. The reversal of 2012101021001 is 1001201012102.
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 a de Polignac number, because none of the positive numbers 2k-2012101021001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2012101011001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43741326521 + ... + 43741326566.
It is an arithmetic number, because the mean of its divisors is an integer number (524895918528).
Almost surely, 22012101021001 is an apocalyptic number.
It is an amenable number.
2012101021001 is a deficient number, since it is larger than the sum of its proper divisors (87482653111).
2012101021001 is an equidigital number, since it uses as much as digits as its factorization.
2012101021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87482653110.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2012101021001 its reverse (1001201012102), we get a palindrome (3013302033103).
The spelling of 2012101021001 in words is "two trillion, twelve billion, one hundred one million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •