Base | Representation |
---|---|
bin | 110010010000001001011110… |
… | …011110101001101101000011 |
3 | 1001222112112122010121112102022 |
4 | 302100021132132221231003 |
5 | 212432030100111223021 |
6 | 2102015303341312055 |
7 | 64360406460241010 |
oct | 6220113636515503 |
9 | 1058475563545368 |
10 | 221012012211011 |
11 | 6446a73913819a |
12 | 2095573786562b |
13 | 9642460389cc8 |
14 | 3c810777a4707 |
15 | 1a8406a0201ab |
hex | c9025e7a9b43 |
221012012211011 has 4 divisors (see below), whose sum is σ = 252585156812592. Its totient is φ = 189438867609432.
The previous prime is 221012012210953. The next prime is 221012012211041. The reversal of 221012012211011 is 110112210210122.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 221012012211011 - 214 = 221012012194627 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221012012211041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15786572300780 + ... + 15786572300793.
It is an arithmetic number, because the mean of its divisors is an integer number (63146289203148).
Almost surely, 2221012012211011 is an apocalyptic number.
221012012211011 is a deficient number, since it is larger than the sum of its proper divisors (31573144601581).
221012012211011 is an equidigital number, since it uses as much as digits as its factorization.
221012012211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31573144601580.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 221012012211011 its reverse (110112210210122), we get a palindrome (331124222421133).
The spelling of 221012012211011 in words is "two hundred twenty-one trillion, twelve billion, twelve million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •