Base | Representation |
---|---|
bin | 10110101111100000101111… |
… | …111001111100111010010111 |
3 | 111010011000021022011112021111 |
4 | 112233200233321330322113 |
5 | 101102230030020010403 |
6 | 552421250132155451 |
7 | 30032231312036653 |
oct | 2657405771747227 |
9 | 433130238145244 |
10 | 100022002110103 |
11 | 29963102694147 |
12 | b274b26168b87 |
13 | 43a705a5564c8 |
14 | 1a9b13ad81a63 |
15 | b86c061b856d |
hex | 5af82fe7ce97 |
100022002110103 has 4 divisors (see below), whose sum is σ = 100022315745160. Its totient is φ = 100021688475048.
The previous prime is 100022002110059. The next prime is 100022002110119. The reversal of 100022002110103 is 301011200220001.
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 100022002110103 - 241 = 97822978854551 is a prime.
It is a super-2 number, since 2×1000220021101032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100022002110703) 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, 156338673 + ... + 156977146.
It is an arithmetic number, because the mean of its divisors is an integer number (25005578936290).
Almost surely, 2100022002110103 is an apocalyptic number.
100022002110103 is a deficient number, since it is larger than the sum of its proper divisors (313635057).
100022002110103 is an equidigital number, since it uses as much as digits as its factorization.
100022002110103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 313635056.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 100022002110103 its reverse (301011200220001), we get a palindrome (401033202330104).
The spelling of 100022002110103 in words is "one hundred trillion, twenty-two billion, two million, one hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •