Base | Representation |
---|---|
bin | 1001100110000111101101… |
… | …1001110101110011000101 |
3 | 1101100121201012000101110001 |
4 | 2121201323121311303011 |
5 | 2340324421033104001 |
6 | 34234500514001301 |
7 | 2136151321513261 |
oct | 231417331656305 |
9 | 41317635011401 |
10 | 10550510050501 |
11 | 33a849a966003 |
12 | 1224914576231 |
13 | 5b6ba7909935 |
14 | 28690c6d30a1 |
15 | 13469a0bc001 |
hex | 9987b675cc5 |
10550510050501 has 2 divisors, whose sum is σ = 10550510050502. Its totient is φ = 10550510050500.
The previous prime is 10550510050481. The next prime is 10550510050517. The reversal of 10550510050501 is 10505001505501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10189176818401 + 361333232100 = 3192049^2 + 601110^2 .
It is a cyclic number.
It is not a de Polignac number, because 10550510050501 - 241 = 8351486794949 is a prime.
It is a super-2 number, since 2×105505100505012 (a number of 27 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 10550510050501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10550510090501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5275255025250 + 5275255025251.
It is an arithmetic number, because the mean of its divisors is an integer number (5275255025251).
Almost surely, 210550510050501 is an apocalyptic number.
It is an amenable number.
10550510050501 is a deficient number, since it is larger than the sum of its proper divisors (1).
10550510050501 is an equidigital number, since it uses as much as digits as its factorization.
10550510050501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3125, while the sum is 28.
The spelling of 10550510050501 in words is "ten trillion, five hundred fifty billion, five hundred ten million, fifty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •