Base | Representation |
---|---|
bin | 10100011001010010… |
… | …10000101100011001 |
3 | 1001021002112100002111 |
4 | 22030221100230121 |
5 | 134411041423423 |
6 | 5010303032321 |
7 | 535224506461 |
oct | 121451205431 |
9 | 31232470074 |
10 | 10949561113 |
11 | 4709818367 |
12 | 2156b9b6a1 |
13 | 105664755a |
14 | 75c300ba1 |
15 | 44142960d |
hex | 28ca50b19 |
10949561113 has 2 divisors, whose sum is σ = 10949561114. Its totient is φ = 10949561112.
The previous prime is 10949561099. The next prime is 10949561131. The reversal of 10949561113 is 31116594901.
Together with next prime (10949561131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10948901769 + 659344 = 104637^2 + 812^2 .
It is a cyclic number.
It is not a de Polignac number, because 10949561113 - 229 = 10412690201 is a prime.
It is not a weakly prime, because it can be changed into another prime (10949564113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5474780556 + 5474780557.
It is an arithmetic number, because the mean of its divisors is an integer number (5474780557).
Almost surely, 210949561113 is an apocalyptic number.
It is an amenable number.
10949561113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10949561113 is an equidigital number, since it uses as much as digits as its factorization.
10949561113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 29160, while the sum is 40.
The spelling of 10949561113 in words is "ten billion, nine hundred forty-nine million, five hundred sixty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •