Base | Representation |
---|---|
bin | 10011101011011101… |
… | …10110100010111101 |
3 | 1000021022012021102112 |
4 | 21311232312202331 |
5 | 133114134312114 |
6 | 4504211503405 |
7 | 522546205145 |
oct | 116556664275 |
9 | 30238167375 |
10 | 10565150909 |
11 | 4531830285 |
12 | 206a2b7b65 |
13 | cc4b03bb1 |
14 | 723237925 |
15 | 41c7e513e |
hex | 275bb68bd |
10565150909 has 2 divisors, whose sum is σ = 10565150910. Its totient is φ = 10565150908.
The previous prime is 10565150881. The next prime is 10565150923. The reversal of 10565150909 is 90905156501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9464371225 + 1100779684 = 97285^2 + 33178^2 .
It is a cyclic number.
It is not a de Polignac number, because 10565150909 - 216 = 10565085373 is a prime.
It is a super-2 number, since 2×105651509092 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10565150209) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5282575454 + 5282575455.
It is an arithmetic number, because the mean of its divisors is an integer number (5282575455).
Almost surely, 210565150909 is an apocalyptic number.
It is an amenable number.
10565150909 is a deficient number, since it is larger than the sum of its proper divisors (1).
10565150909 is an equidigital number, since it uses as much as digits as its factorization.
10565150909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60750, while the sum is 41.
The spelling of 10565150909 in words is "ten billion, five hundred sixty-five million, one hundred fifty thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •