Base | Representation |
---|---|
bin | 101110101010100001… |
… | …1011011101111010111 |
3 | 100120122220001222120121 |
4 | 1131111003123233113 |
5 | 3120213032224343 |
6 | 114011510012411 |
7 | 10145220145444 |
oct | 1352503335727 |
9 | 316586058517 |
10 | 100211211223 |
11 | 39554686232 |
12 | 17508647107 |
13 | 95b04c09b6 |
14 | 4bc91209cb |
15 | 2917a5aaed |
hex | 17550dbbd7 |
100211211223 has 4 divisors (see below), whose sum is σ = 100271255560. Its totient is φ = 100151166888.
The previous prime is 100211211179. The next prime is 100211211271. The reversal of 100211211223 is 322112112001.
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 100211211223 - 225 = 100177656791 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100211211197 and 100211211206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100211211283) 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, 30019665 + ... + 30023002.
It is an arithmetic number, because the mean of its divisors is an integer number (25067813890).
Almost surely, 2100211211223 is an apocalyptic number.
100211211223 is a deficient number, since it is larger than the sum of its proper divisors (60044337).
100211211223 is an equidigital number, since it uses as much as digits as its factorization.
100211211223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60044336.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 100211211223 its reverse (322112112001), we get a palindrome (422323323224).
The spelling of 100211211223 in words is "one hundred billion, two hundred eleven million, two hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •