Base | Representation |
---|---|
bin | 110000001110011111011000… |
… | …011011010000001000101001 |
3 | 1000210222202100010120212221202 |
4 | 300032133120123100020221 |
5 | 210300034344224013001 |
6 | 2031034151503013545 |
7 | 62450602211456636 |
oct | 6016373033201051 |
9 | 1023882303525852 |
10 | 212102001001001 |
11 | 61644a54093991 |
12 | 1b956956b9a2b5 |
13 | 9147195bc6057 |
14 | 3a53b122dd18d |
15 | 197c3d6c0896b |
hex | c0e7d86d0229 |
212102001001001 has 8 divisors (see below), whose sum is σ = 223769249015520. Its totient is φ = 200485151466912.
The previous prime is 212102001000983. The next prime is 212102001001057. The reversal of 212102001001001 is 100100100201212.
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 212102001001001 - 214 = 212102000984617 is a prime.
It is a Duffinian number.
212102001001001 is a modest number, since divided by 1001001 gives 212102 as remainder.
It is not an unprimeable number, because it can be changed into a prime (212102001001301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12599611460 + ... + 12599628293.
It is an arithmetic number, because the mean of its divisors is an integer number (27971156126940).
Almost surely, 2212102001001001 is an apocalyptic number.
It is an amenable number.
212102001001001 is a deficient number, since it is larger than the sum of its proper divisors (11667248014519).
212102001001001 is a wasteful number, since it uses less digits than its factorization.
212102001001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25199240215.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 212102001001001 its reverse (100100100201212), we get a palindrome (312202101202213).
The spelling of 212102001001001 in words is "two hundred twelve trillion, one hundred two billion, one million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •