Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …000101101101111100011101 |
3 | 111020121111220122010002000120 |
4 | 112331233223011231330131 |
5 | 101214241201112010414 |
6 | 554450445550545153 |
7 | 30163005430622424 |
oct | 2675575305557435 |
9 | 436544818102016 |
10 | 101000100110109 |
11 | 2a1aa9a14992a2 |
12 | b3b25b52081b9 |
13 | 4448365093425 |
14 | 1ad26066782bb |
15 | ba239ec0d2a9 |
hex | 5bdbeb16df1d |
101000100110109 has 4 divisors (see below), whose sum is σ = 134666800146816. Its totient is φ = 67333400073404.
The previous prime is 101000100110053. The next prime is 101000100110113. The reversal of 101000100110109 is 901011001000101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101000100110109 - 212 = 101000100106013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000100110149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16833350018349 + ... + 16833350018354.
It is an arithmetic number, because the mean of its divisors is an integer number (33666700036704).
Almost surely, 2101000100110109 is an apocalyptic number.
It is an amenable number.
101000100110109 is a deficient number, since it is larger than the sum of its proper divisors (33666700036707).
101000100110109 is an equidigital number, since it uses as much as digits as its factorization.
101000100110109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33666700036706.
The product of its (nonzero) digits is 9, while the sum is 15.
The spelling of 101000100110109 in words is "one hundred one trillion, one hundred million, one hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •