Base | Representation |
---|---|
bin | 11101011010001100111… |
… | …111001101110111000001 |
3 | 21011012112222001221200201 |
4 | 131122030333031313001 |
5 | 231103002000324301 |
6 | 4144233512045201 |
7 | 266004156440353 |
oct | 35321477156701 |
9 | 7135488057621 |
10 | 2021000011201 |
11 | 70a112901046 |
12 | 287824993801 |
13 | 11876c1812c2 |
14 | 6db618c70d3 |
15 | 3788692d201 |
hex | 1d68cfcddc1 |
2021000011201 has 8 divisors (see below), whose sum is σ = 2041160515200. Its totient is φ = 2000842460400.
The previous prime is 2021000011133. The next prime is 2021000011229. The reversal of 2021000011201 is 1021100001202.
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 2021000011201 - 221 = 2020997914049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2021000011231) 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, 650170 + ... + 2112988.
It is an arithmetic number, because the mean of its divisors is an integer number (255145064400).
Almost surely, 22021000011201 is an apocalyptic number.
It is an amenable number.
2021000011201 is a deficient number, since it is larger than the sum of its proper divisors (20160503999).
2021000011201 is a wasteful number, since it uses less digits than its factorization.
2021000011201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1476599.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2021000011201 its reverse (1021100001202), we get a palindrome (3042100012403).
Subtracting from 2021000011201 its reverse (1021100001202), we obtain a palindrome (999900009999).
It can be divided in two parts, 202100001 and 1201, that added together give a palindrome (202101202).
The spelling of 2021000011201 in words is "two trillion, twenty-one billion, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •