Base | Representation |
---|---|
bin | 1001100011001101100111… |
… | …01101010110101011110001 |
3 | 2202100200112110202221010211 |
4 | 10301212303231112223301 |
5 | 10223040233142334301 |
6 | 112355435442224121 |
7 | 4265165041446610 |
oct | 461466355265361 |
9 | 82320473687124 |
10 | 21001110121201 |
11 | 6767580190471 |
12 | 24321a5355041 |
13 | b9451c565012 |
14 | 52865dcb9877 |
15 | 266448cd2051 |
hex | 1319b3b56af1 |
21001110121201 has 8 divisors (see below), whose sum is σ = 24290440622784. Its totient is φ = 17784072597840.
The previous prime is 21001110121151. The next prime is 21001110121217. The reversal of 21001110121201 is 10212101110012.
It is a happy number.
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 21001110121201 - 217 = 21001109990129 is a prime.
It is a super-2 number, since 2×210011101212012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21001110121601) 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, 18073243930 + ... + 18073245091.
It is an arithmetic number, because the mean of its divisors is an integer number (3036305077848).
Almost surely, 221001110121201 is an apocalyptic number.
It is an amenable number.
21001110121201 is a deficient number, since it is larger than the sum of its proper divisors (3289330501583).
21001110121201 is an equidigital number, since it uses as much as digits as its factorization.
21001110121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36146489111.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 21001110121201 its reverse (10212101110012), we get a palindrome (31213211231213).
The spelling of 21001110121201 in words is "twenty-one trillion, one billion, one hundred ten million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •