Base | Representation |
---|---|
bin | 10011110100111101… |
… | …00100101100001101 |
3 | 1000110212000022200001 |
4 | 21322132210230031 |
5 | 133300030111144 |
6 | 4520134204301 |
7 | 524534022361 |
oct | 117236445415 |
9 | 30425008601 |
10 | 10644769549 |
11 | 4572770a07 |
12 | 2090ab3691 |
13 | 100845c80b |
14 | 72da412a1 |
15 | 4247c0bd4 |
hex | 27a7a4b0d |
10644769549 has 2 divisors, whose sum is σ = 10644769550. Its totient is φ = 10644769548.
The previous prime is 10644769537. The next prime is 10644769561. The reversal of 10644769549 is 94596744601.
It is a balanced prime because it is at equal distance from previous prime (10644769537) and next prime (10644769561).
It can be written as a sum of positive squares in only one way, i.e., 10413182025 + 231587524 = 102045^2 + 15218^2 .
It is a cyclic number.
It is not a de Polignac number, because 10644769549 - 25 = 10644769517 is a prime.
It is a super-2 number, since 2×106447695492 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10644769549.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10644269549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5322384774 + 5322384775.
It is an arithmetic number, because the mean of its divisors is an integer number (5322384775).
Almost surely, 210644769549 is an apocalyptic number.
It is an amenable number.
10644769549 is a deficient number, since it is larger than the sum of its proper divisors (1).
10644769549 is an equidigital number, since it uses as much as digits as its factorization.
10644769549 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6531840, while the sum is 55.
The spelling of 10644769549 in words is "ten billion, six hundred forty-four million, seven hundred sixty-nine thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •