Base | Representation |
---|---|
bin | 101101101101001110011101… |
… | …101100110011000010101001 |
3 | 222100202022202102210220021201 |
4 | 231231032131230303002221 |
5 | 202322002430012333001 |
6 | 1551311151352004201 |
7 | 60225133666303315 |
oct | 5555163554630251 |
9 | 870668672726251 |
10 | 201020000121001 |
11 | 59062115540166 |
12 | 1a667033390661 |
13 | 8822148c75439 |
14 | 378d5c4384b45 |
15 | 1838ed1597501 |
hex | b6d39db330a9 |
201020000121001 has 4 divisors (see below), whose sum is σ = 203010297152004. Its totient is φ = 199029703090000.
The previous prime is 201020000120971. The next prime is 201020000121013. The reversal of 201020000121001 is 100121000020102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 152712774005401 + 48307226115600 = 12357701^2 + 6950340^2 .
It is a cyclic number.
It is not a de Polignac number, because 201020000121001 - 27 = 201020000120873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201020000821001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 995148515350 + ... + 995148515551.
It is an arithmetic number, because the mean of its divisors is an integer number (50752574288001).
Almost surely, 2201020000121001 is an apocalyptic number.
It is an amenable number.
201020000121001 is a deficient number, since it is larger than the sum of its proper divisors (1990297031003).
201020000121001 is a wasteful number, since it uses less digits than its factorization.
201020000121001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1990297031002.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 201020000121001 its reverse (100121000020102), we get a palindrome (301141000141103).
The spelling of 201020000121001 in words is "two hundred one trillion, twenty billion, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •