Base | Representation |
---|---|
bin | 10011111011100010… |
… | …10101100110111101 |
3 | 1000121200222100020212 |
4 | 21331301111212331 |
5 | 133403201121112 |
6 | 4525430322205 |
7 | 526104446021 |
oct | 117561254675 |
9 | 30550870225 |
10 | 10700020157 |
11 | 45a0978572 |
12 | 20a74b9365 |
13 | 1016a35a98 |
14 | 737104381 |
15 | 429586522 |
hex | 27dc559bd |
10700020157 has 2 divisors, whose sum is σ = 10700020158. Its totient is φ = 10700020156.
The previous prime is 10700020153. The next prime is 10700020193. The reversal of 10700020157 is 75102000701.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10178993881 + 521026276 = 100891^2 + 22826^2 .
It is a cyclic number.
It is not a de Polignac number, because 10700020157 - 22 = 10700020153 is a prime.
It is a super-4 number, since 4×107000201574 (a number of 41 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10700020153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5350010078 + 5350010079.
It is an arithmetic number, because the mean of its divisors is an integer number (5350010079).
Almost surely, 210700020157 is an apocalyptic number.
It is an amenable number.
10700020157 is a deficient number, since it is larger than the sum of its proper divisors (1).
10700020157 is an equidigital number, since it uses as much as digits as its factorization.
10700020157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 490, while the sum is 23.
Adding to 10700020157 its reverse (75102000701), we get a palindrome (85802020858).
The spelling of 10700020157 in words is "ten billion, seven hundred million, twenty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •