Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …110010101011000110001101 |
3 | 111010110112001010020110210211 |
4 | 112300303221302223012031 |
5 | 101110204332122011341 |
6 | 552530211233002421 |
7 | 30041532255412051 |
oct | 2660635162530615 |
9 | 433415033213724 |
10 | 100111020110221 |
11 | 29997932a6618a |
12 | b28a22a0b3411 |
13 | 43b2575aa1663 |
14 | 1aa1583699c61 |
15 | b891b621c181 |
hex | 5b0ce9cab18d |
100111020110221 has 8 divisors (see below), whose sum is σ = 103343206028544. Its totient is φ = 96879009077760.
The previous prime is 100111020110111. The next prime is 100111020110273. The reversal of 100111020110221 is 122011020111001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100111020110221 - 213 = 100111020102029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100111020110021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42557620 + ... + 44848333.
It is an arithmetic number, because the mean of its divisors is an integer number (12917900753568).
Almost surely, 2100111020110221 is an apocalyptic number.
It is an amenable number.
100111020110221 is a deficient number, since it is larger than the sum of its proper divisors (3232185918323).
100111020110221 is an equidigital number, since it uses as much as digits as its factorization.
100111020110221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87442931.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100111020110221 its reverse (122011020111001), we get a palindrome (222122040221222).
The spelling of 100111020110221 in words is "one hundred trillion, one hundred eleven billion, twenty million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •