Base | Representation |
---|---|
bin | 1001101001101001001111… |
… | …10011011111111010001001 |
3 | 2210010210221201111222012222 |
4 | 10310310213303133322021 |
5 | 10240200330403033001 |
6 | 113045144304343425 |
7 | 4320150311012402 |
oct | 464644763377211 |
9 | 83123851458188 |
10 | 21222101221001 |
11 | 684227397562a |
12 | 2468b9a914b75 |
13 | bac30a6a0bb5 |
14 | 535225b549a9 |
15 | 26c07eee661b |
hex | 134d27cdfe89 |
21222101221001 has 8 divisors (see below), whose sum is σ = 23447436643584. Its totient is φ = 19105318745920.
The previous prime is 21222101220923. The next prime is 21222101221003. The reversal of 21222101221001 is 10012210122212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21222101221001 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (21222101221003) 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, 27138236465 + ... + 27138237246.
It is an arithmetic number, because the mean of its divisors is an integer number (2930929580448).
Almost surely, 221222101221001 is an apocalyptic number.
It is an amenable number.
21222101221001 is a deficient number, since it is larger than the sum of its proper divisors (2225335422583).
21222101221001 is a wasteful number, since it uses less digits than its factorization.
21222101221001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54276473751.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 21222101221001 its reverse (10012210122212), we get a palindrome (31234311343213).
The spelling of 21222101221001 in words is "twenty-one trillion, two hundred twenty-two billion, one hundred one million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •