Base | Representation |
---|---|
bin | 101101101101001111100101… |
… | …110100001000001001010001 |
3 | 222100202102212202102020000010 |
4 | 231231033211310020021101 |
5 | 202322012414230031001 |
6 | 1551311511411545133 |
7 | 60225205660154214 |
oct | 5555174564101121 |
9 | 870672782366003 |
10 | 201021210002001 |
11 | 59062686485714 |
12 | 1a6673105bb1a9 |
13 | 88222ac81925c |
14 | 378d69ad2777b |
15 | 18390528d58d6 |
hex | b6d3e5d08251 |
201021210002001 has 8 divisors (see below), whose sum is σ = 268224350439744. Its totient is φ = 133916104782800.
The previous prime is 201021210001991. The next prime is 201021210002027. The reversal of 201021210002001 is 100200012120102.
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 201021210002001 - 233 = 201012620067409 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201021210012001) 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 7 ways as a sum of consecutive naturals, for example, 24508799850 + ... + 24508808051.
It is an arithmetic number, because the mean of its divisors is an integer number (33528043804968).
Almost surely, 2201021210002001 is an apocalyptic number.
It is an amenable number.
201021210002001 is a deficient number, since it is larger than the sum of its proper divisors (67203140437743).
201021210002001 is a wasteful number, since it uses less digits than its factorization.
201021210002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49017609271.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 201021210002001 its reverse (100200012120102), we get a palindrome (301221222122103).
The spelling of 201021210002001 in words is "two hundred one trillion, twenty-one billion, two hundred ten million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •