Base | Representation |
---|---|
bin | 10010110100000010… |
… | …00000111101100001 |
3 | 222001220012210020211 |
4 | 21122001000331201 |
5 | 131141114300423 |
6 | 4350121134121 |
7 | 505201600534 |
oct | 113201007541 |
9 | 28056183224 |
10 | 10100150113 |
11 | 43132a92a9 |
12 | 1b5a62a341 |
13 | c4c6843b1 |
14 | 6bb592a1b |
15 | 3e1a9210d |
hex | 25a040f61 |
10100150113 has 4 divisors (see below), whose sum is σ = 10123584768. Its totient is φ = 10076715460.
The previous prime is 10100150101. The next prime is 10100150129. The reversal of 10100150113 is 31105100101.
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 10100150113 - 213 = 10100141921 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10100150093 and 10100150102.
It is not an unprimeable number, because it can be changed into a prime (10100156113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11716681 + ... + 11717542.
It is an arithmetic number, because the mean of its divisors is an integer number (2530896192).
Almost surely, 210100150113 is an apocalyptic number.
It is an amenable number.
10100150113 is a deficient number, since it is larger than the sum of its proper divisors (23434655).
10100150113 is an equidigital number, since it uses as much as digits as its factorization.
10100150113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23434654.
The product of its (nonzero) digits is 15, while the sum is 13.
Adding to 10100150113 its reverse (31105100101), we get a palindrome (41205250214).
The spelling of 10100150113 in words is "ten billion, one hundred million, one hundred fifty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •