Base | Representation |
---|---|
bin | 10100011010001010… |
… | …01000111000011101 |
3 | 1001021121021121211111 |
4 | 22031011020320131 |
5 | 134414424303044 |
6 | 5011123422021 |
7 | 535343564632 |
oct | 121505107035 |
9 | 31247247744 |
10 | 10956869149 |
11 | 4712959a66 |
12 | 2159524911 |
13 | 1058005a35 |
14 | 75d284189 |
15 | 441dbeb34 |
hex | 28d148e1d |
10956869149 has 2 divisors, whose sum is σ = 10956869150. Its totient is φ = 10956869148.
The previous prime is 10956869141. The next prime is 10956869197. The reversal of 10956869149 is 94196865901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8591992249 + 2364876900 = 92693^2 + 48630^2 .
It is an emirp because it is prime and its reverse (94196865901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10956869149 - 23 = 10956869141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10956869093 and 10956869102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10956869141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5478434574 + 5478434575.
It is an arithmetic number, because the mean of its divisors is an integer number (5478434575).
Almost surely, 210956869149 is an apocalyptic number.
It is an amenable number.
10956869149 is a deficient number, since it is larger than the sum of its proper divisors (1).
10956869149 is an equidigital number, since it uses as much as digits as its factorization.
10956869149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4199040, while the sum is 58.
The spelling of 10956869149 in words is "ten billion, nine hundred fifty-six million, eight hundred sixty-nine thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •