Base | Representation |
---|---|
bin | 10110110000110100110000… |
… | …001111100111010111001101 |
3 | 111010110122002111100220000022 |
4 | 112300310300033213113031 |
5 | 101110214242214232341 |
6 | 552530524415111525 |
7 | 30041603460235631 |
oct | 2660646017472715 |
9 | 433418074326008 |
10 | 100112202102221 |
11 | 2999838a192281 |
12 | b28a4b9b125a5 |
13 | 43b270392c2ca |
14 | 1aa165665cdc1 |
15 | b89234d9be4b |
hex | 5b0d303e75cd |
100112202102221 has 32 divisors (see below), whose sum is σ = 105437562667008. Its totient is φ = 94870140805440.
The previous prime is 100112202102193. The next prime is 100112202102287. The reversal of 100112202102221 is 122201202211001.
It is a de Polignac number, because none of the positive numbers 2k-100112202102221 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 100112202102221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100112202002221) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7301590556 + ... + 7301604266.
It is an arithmetic number, because the mean of its divisors is an integer number (3294923833344).
Almost surely, 2100112202102221 is an apocalyptic number.
It is an amenable number.
100112202102221 is a deficient number, since it is larger than the sum of its proper divisors (5325360564787).
100112202102221 is a wasteful number, since it uses less digits than its factorization.
100112202102221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17241.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 100112202102221 its reverse (122201202211001), we get a palindrome (222313404313222).
The spelling of 100112202102221 in words is "one hundred trillion, one hundred twelve billion, two hundred two million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •