Base | Representation |
---|---|
bin | 1001100110101011010000… |
… | …01000011000001100000001 |
3 | 2202210001200011112002220122 |
4 | 10303111220020120030001 |
5 | 10232012431403033441 |
6 | 112530235054350025 |
7 | 4306606540222430 |
oct | 463255010301401 |
9 | 82701604462818 |
10 | 21120101221121 |
11 | 6802a915a2a71 |
12 | 24512731bb315 |
13 | ba2803717196 |
14 | 53030b239117 |
15 | 2695b03e934b |
hex | 133568218301 |
21120101221121 has 8 divisors (see below), whose sum is σ = 24137421122304. Its totient is φ = 18102821965920.
The previous prime is 21120101221117. The next prime is 21120101221127. The reversal of 21120101221121 is 12112210102112.
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 21120101221121 - 22 = 21120101221117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21120101221121.
It is not an unprimeable number, because it can be changed into a prime (21120101221127) 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, 9039785 + ... + 11133638.
It is an arithmetic number, because the mean of its divisors is an integer number (3017177640288).
Almost surely, 221120101221121 is an apocalyptic number.
It is an amenable number.
21120101221121 is a deficient number, since it is larger than the sum of its proper divisors (3017319901183).
21120101221121 is a wasteful number, since it uses less digits than its factorization.
21120101221121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20322991.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 21120101221121 its reverse (12112210102112), we get a palindrome (33232311323233).
The spelling of 21120101221121 in words is "twenty-one trillion, one hundred twenty billion, one hundred one million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •