Base | Representation |
---|---|
bin | 101110100100101000… |
… | …0000111110111011111 |
3 | 100120011002111112110211 |
4 | 1131021100013313133 |
5 | 3114311340223403 |
6 | 113540114113251 |
7 | 10140264160561 |
oct | 1351120076737 |
9 | 316132445424 |
10 | 100013211103 |
11 | 39462939873 |
12 | 1747227b827 |
13 | 957b486a70 |
14 | 4baaadd331 |
15 | 290549906d |
hex | 1749407ddf |
100013211103 has 8 divisors (see below), whose sum is σ = 107709278096. Its totient is φ = 92317536000.
The previous prime is 100013211019. The next prime is 100013211119. The reversal of 100013211103 is 301112310001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100013211103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100013211203) 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, 635503 + ... + 777103.
It is an arithmetic number, because the mean of its divisors is an integer number (13463659762).
Almost surely, 2100013211103 is an apocalyptic number.
100013211103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
100013211103 is a deficient number, since it is larger than the sum of its proper divisors (7696066993).
100013211103 is a wasteful number, since it uses less digits than its factorization.
100013211103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195945.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 100013211103 its reverse (301112310001), we get a palindrome (401125521104).
The spelling of 100013211103 in words is "one hundred billion, thirteen million, two hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •