Base | Representation |
---|---|
bin | 1001100110101011010000… |
… | …01000011011001000111011 |
3 | 2202210001200011112201111102 |
4 | 10303111220020123020323 |
5 | 10232012431403430321 |
6 | 112530235054522015 |
7 | 4306606540302611 |
oct | 463255010331073 |
9 | 82701604481442 |
10 | 21120101233211 |
11 | 6802a91601062 |
12 | 245127320630b |
13 | ba280371c836 |
14 | 53030b23d6b1 |
15 | 2695b03ecc0b |
hex | 13356821b23b |
21120101233211 has 4 divisors (see below), whose sum is σ = 21135619310424. Its totient is φ = 21104583156000.
The previous prime is 21120101233199. The next prime is 21120101233277. The reversal of 21120101233211 is 11233210102112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21120101233211 - 238 = 20845223326267 is a prime.
It is a super-2 number, since 2×211201012332112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21120101233811) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7759036565 + ... + 7759039286.
It is an arithmetic number, because the mean of its divisors is an integer number (5283904827606).
Almost surely, 221120101233211 is an apocalyptic number.
21120101233211 is a deficient number, since it is larger than the sum of its proper divisors (15518077213).
21120101233211 is a wasteful number, since it uses less digits than its factorization.
21120101233211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15518077212.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 21120101233211 its reverse (11233210102112), we get a palindrome (32353311335323).
The spelling of 21120101233211 in words is "twenty-one trillion, one hundred twenty billion, one hundred one million, two hundred thirty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •