Base | Representation |
---|---|
bin | 10011110110111010… |
… | …00011111100111111 |
3 | 1000111222211120010221 |
4 | 21323131003330333 |
5 | 133313223304102 |
6 | 4521521242211 |
7 | 525123166336 |
oct | 117335037477 |
9 | 30458746127 |
10 | 10661150527 |
11 | 4580a3a205 |
12 | 2096493367 |
13 | 100b9768c1 |
14 | 731ca6d1d |
15 | 425e59637 |
hex | 27b743f3f |
10661150527 has 2 divisors, whose sum is σ = 10661150528. Its totient is φ = 10661150526.
The previous prime is 10661150503. The next prime is 10661150531. The reversal of 10661150527 is 72505116601.
It is a strong prime.
It is an emirp because it is prime and its reverse (72505116601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10661150527 - 211 = 10661148479 is a prime.
It is a super-2 number, since 2×106611505272 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10661150492 and 10661150501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10661150587) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5330575263 + 5330575264.
It is an arithmetic number, because the mean of its divisors is an integer number (5330575264).
Almost surely, 210661150527 is an apocalyptic number.
10661150527 is a deficient number, since it is larger than the sum of its proper divisors (1).
10661150527 is an equidigital number, since it uses as much as digits as its factorization.
10661150527 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 34.
The spelling of 10661150527 in words is "ten billion, six hundred sixty-one million, one hundred fifty thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •