Base | Representation |
---|---|
bin | 10110110010011010000101… |
… | …000110101111010011011011 |
3 | 111010212000220210211211020111 |
4 | 112302122011012233103123 |
5 | 101114010102001134321 |
6 | 553052520344105151 |
7 | 30052504544263006 |
oct | 2662320506572333 |
9 | 433760823754214 |
10 | 100221000021211 |
11 | 29a2a53a835103 |
12 | b2a76021651b7 |
13 | 43bca52086774 |
14 | 1aa6a17d3053d |
15 | b8bea16975e1 |
hex | 5b26851af4db |
100221000021211 has 4 divisors (see below), whose sum is σ = 100233801280800. Its totient is φ = 100208198761624.
The previous prime is 100221000021199. The next prime is 100221000021217. The reversal of 100221000021211 is 112120000122001.
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 100221000021211 - 227 = 100220865803483 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100221000021191 and 100221000021200.
It is not an unprimeable number, because it can be changed into a prime (100221000021217) 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, 6400618051 + ... + 6400633708.
It is an arithmetic number, because the mean of its divisors is an integer number (25058450320200).
Almost surely, 2100221000021211 is an apocalyptic number.
100221000021211 is a deficient number, since it is larger than the sum of its proper divisors (12801259589).
100221000021211 is an equidigital number, since it uses as much as digits as its factorization.
100221000021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12801259588.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100221000021211 its reverse (112120000122001), we get a palindrome (212341000143212).
The spelling of 100221000021211 in words is "one hundred trillion, two hundred twenty-one billion, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •