Base | Representation |
---|---|
bin | 11101010001111010100… |
… | …000011010100010101001 |
3 | 21010100120201011011021010 |
4 | 131101322200122202221 |
5 | 230431240100342301 |
6 | 4140202422134133 |
7 | 265240466624406 |
oct | 35217240324251 |
9 | 7110521134233 |
10 | 2012100012201 |
11 | 706366002074 |
12 | 285b60281349 |
13 | 1179813450c6 |
14 | 6d5598a32ad |
15 | 375154065d6 |
hex | 1d47a81a8a9 |
2012100012201 has 8 divisors (see below), whose sum is σ = 2686325380704. Its totient is φ = 1339637325920.
The previous prime is 2012100012191. The next prime is 2012100012203. The reversal of 2012100012201 is 1022100012102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2012100012201 - 210 = 2012100011177 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2012100012203) 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 7 ways as a sum of consecutive naturals, for example, 440667891 + ... + 440672456.
It is an arithmetic number, because the mean of its divisors is an integer number (335790672588).
Almost surely, 22012100012201 is an apocalyptic number.
It is an amenable number.
2012100012201 is a deficient number, since it is larger than the sum of its proper divisors (674225368503).
2012100012201 is an equidigital number, since it uses as much as digits as its factorization.
2012100012201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 881341111.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2012100012201 its reverse (1022100012102), we get a palindrome (3034200024303).
Subtracting from 2012100012201 its reverse (1022100012102), we obtain a palindrome (990000000099).
The spelling of 2012100012201 in words is "two trillion, twelve billion, one hundred million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •