Base | Representation |
---|---|
bin | 1001001011111010010000… |
… | …0101110100010010011011 |
3 | 1022202120102202220200220211 |
4 | 2102332210011310102123 |
5 | 2310440223100214321 |
6 | 33251551051031551 |
7 | 2061500615553613 |
oct | 222764405642233 |
9 | 38676382820824 |
10 | 10100221101211 |
11 | 324453055479a |
12 | 11715a773b5b7 |
13 | 5835a66cc987 |
14 | 26cbd36a5a43 |
15 | 127ae37a40e1 |
hex | 92fa417449b |
10100221101211 has 4 divisors (see below), whose sum is σ = 10100892093552. Its totient is φ = 10099550108872.
The previous prime is 10100221101167. The next prime is 10100221101233. The reversal of 10100221101211 is 11210112200101.
It is a happy number.
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 10100221101211 - 213 = 10100221093019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10100221101191 and 10100221101200.
It is not an unprimeable number, because it can be changed into a prime (10100221101281) 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, 335473591 + ... + 335503696.
It is an arithmetic number, because the mean of its divisors is an integer number (2525223023388).
Almost surely, 210100221101211 is an apocalyptic number.
10100221101211 is a deficient number, since it is larger than the sum of its proper divisors (670992341).
10100221101211 is an equidigital number, since it uses as much as digits as its factorization.
10100221101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670992340.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10100221101211 its reverse (11210112200101), we get a palindrome (21310333301312).
The spelling of 10100221101211 in words is "ten trillion, one hundred billion, two hundred twenty-one million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •