Base | Representation |
---|---|
bin | 10010110101110001… |
… | …01000110001111111 |
3 | 222002220122120122200 |
4 | 21122320220301333 |
5 | 131203332344020 |
6 | 4351401442543 |
7 | 505436540025 |
oct | 113270506177 |
9 | 28086576580 |
10 | 10114731135 |
11 | 4320558233 |
12 | 1b634a0453 |
13 | c526bb112 |
14 | 6bd4aa715 |
15 | 3e2ec2590 |
hex | 25ae28c7f |
10114731135 has 24 divisors (see below), whose sum is σ = 17687361744. Its totient is φ = 5346781440.
The previous prime is 10114731131. The next prime is 10114731167. The reversal of 10114731135 is 53113741101.
It is not a de Polignac number, because 10114731135 - 22 = 10114731131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10114731099 and 10114731108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10114731131) 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 23 ways as a sum of consecutive naturals, for example, 989481 + ... + 999650.
It is an arithmetic number, because the mean of its divisors is an integer number (736973406).
Almost surely, 210114731135 is an apocalyptic number.
10114731135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10114731135 is a deficient number, since it is larger than the sum of its proper divisors (7572630609).
10114731135 is a wasteful number, since it uses less digits than its factorization.
10114731135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1989255 (or 1989252 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The spelling of 10114731135 in words is "ten billion, one hundred fourteen million, seven hundred thirty-one thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •