Base | Representation |
---|---|
bin | 1001100110011100100100… |
… | …11011110000110100000001 |
3 | 2202202022022222111222002222 |
4 | 10303032102123300310001 |
5 | 10231400312034324301 |
6 | 112522453114220425 |
7 | 4306210342440455 |
oct | 463162233606401 |
9 | 82668288458088 |
10 | 21112221011201 |
11 | 67aa708403691 |
12 | 244b834124715 |
13 | ba1b48c56588 |
14 | 52dba0834665 |
15 | 26929d6b231b |
hex | 1333926f0d01 |
21112221011201 has 8 divisors (see below), whose sum is σ = 21124273140480. Its totient is φ = 21100172327568.
The previous prime is 21112221011179. The next prime is 21112221011221. The reversal of 21112221011201 is 10211012221112.
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 21112221011201 - 242 = 16714174500097 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 21112221011201.
It is not an unprimeable number, because it can be changed into a prime (21112221011221) 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, 11446640 + ... + 13162446.
It is an arithmetic number, because the mean of its divisors is an integer number (2640534142560).
Almost surely, 221112221011201 is an apocalyptic number.
It is an amenable number.
21112221011201 is a deficient number, since it is larger than the sum of its proper divisors (12052129279).
21112221011201 is a wasteful number, since it uses less digits than its factorization.
21112221011201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1722823.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 21112221011201 its reverse (10211012221112), we get a palindrome (31323233232313).
The spelling of 21112221011201 in words is "twenty-one trillion, one hundred twelve billion, two hundred twenty-one million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •