Base | Representation |
---|---|
bin | 1011101100110010011… |
… | …0000000101100110101 |
3 | 201012211002212100211201 |
4 | 2323030212000230311 |
5 | 11243122224341041 |
6 | 232201045132501 |
7 | 20343664261255 |
oct | 2731446005465 |
9 | 635732770751 |
10 | 201001012021 |
11 | 78275916367 |
12 | 32b569ba131 |
13 | 15c53821b94 |
14 | 9a2b013965 |
15 | 53662a5631 |
hex | 2ecc980b35 |
201001012021 has 8 divisors (see below), whose sum is σ = 201332144664. Its totient is φ = 200669952000.
The previous prime is 201001012013. The next prime is 201001012067. The reversal of 201001012021 is 120210100102.
It can be written as a sum of positive squares in 4 ways, for example, as 39626874225 + 161374137796 = 199065^2 + 401714^2 .
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 201001012021 - 23 = 201001012013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201001011989 and 201001012007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201001012001) 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, 9560521 + ... + 9581521.
It is an arithmetic number, because the mean of its divisors is an integer number (25166518083).
Almost surely, 2201001012021 is an apocalyptic number.
It is an amenable number.
201001012021 is a deficient number, since it is larger than the sum of its proper divisors (331132643).
201001012021 is a wasteful number, since it uses less digits than its factorization.
201001012021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36311.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 201001012021 its reverse (120210100102), we get a palindrome (321211112123).
The spelling of 201001012021 in words is "two hundred one billion, one million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •