Base | Representation |
---|---|
bin | 10100011011010111… |
… | …10100101101101101 |
3 | 1001022022100211200101 |
4 | 22031223310231231 |
5 | 134430023311112 |
6 | 5012125031101 |
7 | 535526022355 |
oct | 121553645555 |
9 | 31268324611 |
10 | 10967010157 |
11 | 4718656064 |
12 | 21609b5491 |
13 | 105a14682c |
14 | 760763b65 |
15 | 442c24757 |
hex | 28daf4b6d |
10967010157 has 2 divisors, whose sum is σ = 10967010158. Its totient is φ = 10967010156.
The previous prime is 10967010113. The next prime is 10967010163. The reversal of 10967010157 is 75101076901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10375255881 + 591754276 = 101859^2 + 24326^2 .
It is a cyclic number.
It is not a de Polignac number, because 10967010157 - 211 = 10967008109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10967010757) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5483505078 + 5483505079.
It is an arithmetic number, because the mean of its divisors is an integer number (5483505079).
Almost surely, 210967010157 is an apocalyptic number.
It is an amenable number.
10967010157 is a deficient number, since it is larger than the sum of its proper divisors (1).
10967010157 is an equidigital number, since it uses as much as digits as its factorization.
10967010157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13230, while the sum is 37.
The spelling of 10967010157 in words is "ten billion, nine hundred sixty-seven million, ten thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •