Base | Representation |
---|---|
bin | 1001100110101100000111… |
… | …00000000001111010111001 |
3 | 2202210002212011120010102110 |
4 | 10303112003200001322321 |
5 | 10232014401430444301 |
6 | 112530352420322533 |
7 | 4306624114225434 |
oct | 463260340017271 |
9 | 82702764503373 |
10 | 21120560406201 |
11 | 68031a7812573 |
12 | 2451380b43449 |
13 | ba28778ab829 |
14 | 53035220881b |
15 | 2695da89e0d6 |
hex | 133583801eb9 |
21120560406201 has 8 divisors (see below), whose sum is σ = 28163862026784. Its totient is φ = 14078816194880.
The previous prime is 21120560406191. The next prime is 21120560406247. The reversal of 21120560406201 is 10260406502112.
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 21120560406201 - 26 = 21120560406137 is a prime.
It is a super-3 number, since 3×211205604062013 (a number of 41 digits) contains 333 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (21120560406901) 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, 389320671 + ... + 389374916.
It is an arithmetic number, because the mean of its divisors is an integer number (3520482753348).
Almost surely, 221120560406201 is an apocalyptic number.
It is an amenable number.
21120560406201 is a deficient number, since it is larger than the sum of its proper divisors (7043301620583).
21120560406201 is an equidigital number, since it uses as much as digits as its factorization.
21120560406201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 778704631.
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 21120560406201 its reverse (10260406502112), we get a palindrome (31380966908313).
The spelling of 21120560406201 in words is "twenty-one trillion, one hundred twenty billion, five hundred sixty million, four hundred six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •