Base | Representation |
---|---|
bin | 10010101110101101… |
… | …11010111001000011 |
3 | 221221210022102011201 |
4 | 21113112322321003 |
5 | 131043210421041 |
6 | 4341445322031 |
7 | 504120566464 |
oct | 112726727103 |
9 | 27853272151 |
10 | 10055560771 |
11 | 42a0113703 |
12 | 1b47706317 |
13 | c43371979 |
14 | 6b56a6d6b |
15 | 3dcbd5631 |
hex | 2575bae43 |
10055560771 has 2 divisors, whose sum is σ = 10055560772. Its totient is φ = 10055560770.
The previous prime is 10055560763. The next prime is 10055560829. The reversal of 10055560771 is 17706555001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10055560771 - 23 = 10055560763 is a prime.
It is a super-2 number, since 2×100555607712 (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 10055560771.
It is not a weakly prime, because it can be changed into another prime (10055500771) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5027780385 + 5027780386.
It is an arithmetic number, because the mean of its divisors is an integer number (5027780386).
Almost surely, 210055560771 is an apocalyptic number.
10055560771 is a deficient number, since it is larger than the sum of its proper divisors (1).
10055560771 is an equidigital number, since it uses as much as digits as its factorization.
10055560771 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36750, while the sum is 37.
The spelling of 10055560771 in words is "ten billion, fifty-five million, five hundred sixty thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •