Base | Representation |
---|---|
bin | 1001100011001101100110… |
… | …01110011100110110100001 |
3 | 2202100200111220112100101101 |
4 | 10301212303032130312201 |
5 | 10223040224104120001 |
6 | 112355434552434401 |
7 | 4265164612546135 |
oct | 461466316346641 |
9 | 82320456470341 |
10 | 21001102020001 |
11 | 6767576657964 |
12 | 24321a26a8a01 |
13 | b9451a9897cc |
14 | 52865cbab3c5 |
15 | 266448231a01 |
hex | 1319b339cda1 |
21001102020001 has 16 divisors (see below), whose sum is σ = 22954200450048. Its totient is φ = 19127776550400.
The previous prime is 21001102019977. The next prime is 21001102020043. The reversal of 21001102020001 is 10002020110012.
It is a cyclic number.
It is not a de Polignac number, because 21001102020001 - 29 = 21001102019489 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21001102020001.
It is not an unprimeable number, because it can be changed into a prime (21001102020901) 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 15 ways as a sum of consecutive naturals, for example, 29791261 + ... + 30488053.
It is an arithmetic number, because the mean of its divisors is an integer number (1434637528128).
Almost surely, 221001102020001 is an apocalyptic number.
It is an amenable number.
21001102020001 is a deficient number, since it is larger than the sum of its proper divisors (1953098430047).
21001102020001 is a wasteful number, since it uses less digits than its factorization.
21001102020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 754032.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 21001102020001 its reverse (10002020110012), we get a palindrome (31003122130013).
The spelling of 21001102020001 in words is "twenty-one trillion, one billion, one hundred two million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •