Base | Representation |
---|---|
bin | 10011111011101101… |
… | …11110101100010001 |
3 | 1000121210202111001111 |
4 | 21331312332230101 |
5 | 133404040433103 |
6 | 4525522133321 |
7 | 526123145662 |
oct | 117566765421 |
9 | 30553674044 |
10 | 10701499153 |
11 | 45a1798784 |
12 | 20a7ab1241 |
13 | 1017133027 |
14 | 7373ab369 |
15 | 42977986d |
hex | 27ddbeb11 |
10701499153 has 2 divisors, whose sum is σ = 10701499154. Its totient is φ = 10701499152.
The previous prime is 10701499129. The next prime is 10701499213. The reversal of 10701499153 is 35199410701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9179172864 + 1522326289 = 95808^2 + 39017^2 .
It is a cyclic number.
It is not a de Polignac number, because 10701499153 - 25 = 10701499121 is a prime.
It is a super-2 number, since 2×107014991532 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10701499453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5350749576 + 5350749577.
It is an arithmetic number, because the mean of its divisors is an integer number (5350749577).
Almost surely, 210701499153 is an apocalyptic number.
It is an amenable number.
10701499153 is a deficient number, since it is larger than the sum of its proper divisors (1).
10701499153 is an equidigital number, since it uses as much as digits as its factorization.
10701499153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34020, while the sum is 40.
The spelling of 10701499153 in words is "ten billion, seven hundred one million, four hundred ninety-nine thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •