Base | Representation |
---|---|
bin | 10011101001110010… |
… | …00101010100100001 |
3 | 1000020022200011100212 |
4 | 21310321011110201 |
5 | 133102032240044 |
6 | 4502545423505 |
7 | 522315331121 |
oct | 116471052441 |
9 | 30208604325 |
10 | 10551055649 |
11 | 4524883302 |
12 | 206563ab95 |
13 | cc1c0a2c4 |
14 | 721408c81 |
15 | 41b45da9e |
hex | 274e45521 |
10551055649 has 2 divisors, whose sum is σ = 10551055650. Its totient is φ = 10551055648.
The previous prime is 10551055589. The next prime is 10551055667. The reversal of 10551055649 is 94655015501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9742677025 + 808378624 = 98705^2 + 28432^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10551055649 is a prime.
It is a super-2 number, since 2×105510556492 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10551055349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5275527824 + 5275527825.
It is an arithmetic number, because the mean of its divisors is an integer number (5275527825).
Almost surely, 210551055649 is an apocalyptic number.
It is an amenable number.
10551055649 is a deficient number, since it is larger than the sum of its proper divisors (1).
10551055649 is an equidigital number, since it uses as much as digits as its factorization.
10551055649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135000, while the sum is 41.
The spelling of 10551055649 in words is "ten billion, five hundred fifty-one million, fifty-five thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.258 sec. • engine limits •