Base | Representation |
---|---|
bin | 1001100011001101011010… |
… | …01101100011000111001001 |
3 | 2202100200020212200002212202 |
4 | 10301212231031203013021 |
5 | 10223040022241321301 |
6 | 112355420550045545 |
7 | 4265162246115464 |
oct | 461465515430711 |
9 | 82320225602782 |
10 | 21001001120201 |
11 | 67675247013a3 |
12 | 24321749498b5 |
13 | b94502abc59b |
14 | 52864d6242db |
15 | 26643e45066b |
hex | 1319ad3631c9 |
21001001120201 has 8 divisors (see below), whose sum is σ = 21047278095144. Its totient is φ = 20954775029760.
The previous prime is 21001001120191. The next prime is 21001001120263. The reversal of 21001001120201 is 10202110010012.
It can be written as a sum of positive squares in 4 ways, for example, as 3114868480201 + 17886132640000 = 1764899^2 + 4229200^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 21001001120201 - 26 = 21001001120137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21001001120291) 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, 11894720 + ... + 13545713.
It is an arithmetic number, because the mean of its divisors is an integer number (2630909761893).
Almost surely, 221001001120201 is an apocalyptic number.
It is an amenable number.
21001001120201 is a deficient number, since it is larger than the sum of its proper divisors (46276974943).
21001001120201 is an equidigital number, since it uses as much as digits as its factorization.
21001001120201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25442251.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 21001001120201 its reverse (10202110010012), we get a palindrome (31203111130213).
The spelling of 21001001120201 in words is "twenty-one trillion, one billion, one million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •