Base | Representation |
---|---|
bin | 101110101000000111… |
… | …0110010100010011111 |
3 | 100120110020211101010211 |
4 | 1131100032302202133 |
5 | 3120031324131421 |
6 | 113555455513251 |
7 | 10143215345020 |
oct | 1352016624237 |
9 | 316406741124 |
10 | 100130302111 |
11 | 39512a43aa4 |
12 | 174a5528827 |
13 | 9599802898 |
14 | 4bbc49cc47 |
15 | 29108c79e1 |
hex | 17503b289f |
100130302111 has 8 divisors (see below), whose sum is σ = 117095901824. Its totient is φ = 83830020120.
The previous prime is 100130302079. The next prime is 100130302123. The reversal of 100130302111 is 111203031001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100130302111 - 25 = 100130302079 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100130302091 and 100130302100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100130305111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 166329105 + ... + 166329706.
It is an arithmetic number, because the mean of its divisors is an integer number (14636987728).
Almost surely, 2100130302111 is an apocalyptic number.
100130302111 is a deficient number, since it is larger than the sum of its proper divisors (16965599713).
100130302111 is an equidigital number, since it uses as much as digits as its factorization.
100130302111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332658861.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 100130302111 its reverse (111203031001), we get a palindrome (211333333112).
The spelling of 100130302111 in words is "one hundred billion, one hundred thirty million, three hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •