Base | Representation |
---|---|
bin | 1001100011001100101101… |
… | …1011010101100101010001 |
3 | 1101011211010212102122120201 |
4 | 2120303023123111211101 |
5 | 2334014120112400221 |
6 | 34155435513135201 |
7 | 2132423354651011 |
oct | 230631333254521 |
9 | 41154125378521 |
10 | 10500313012561 |
11 | 3389180a53489 |
12 | 12170456ba501 |
13 | 5b22380abc18 |
14 | 284309b51c41 |
15 | 13320d2a5891 |
hex | 98ccb6d5951 |
10500313012561 has 2 divisors, whose sum is σ = 10500313012562. Its totient is φ = 10500313012560.
The previous prime is 10500313012471. The next prime is 10500313012591. The reversal of 10500313012561 is 16521031300501.
10500313012561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6553113609025 + 3947199403536 = 2559905^2 + 1986756^2 .
It is a cyclic number.
It is not a de Polignac number, because 10500313012561 - 231 = 10498165528913 is a prime.
It is a super-2 number, since 2×105003130125612 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10500313012591) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5250156506280 + 5250156506281.
It is an arithmetic number, because the mean of its divisors is an integer number (5250156506281).
Almost surely, 210500313012561 is an apocalyptic number.
It is an amenable number.
10500313012561 is a deficient number, since it is larger than the sum of its proper divisors (1).
10500313012561 is an equidigital number, since it uses as much as digits as its factorization.
10500313012561 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2700, while the sum is 28.
The spelling of 10500313012561 in words is "ten trillion, five hundred billion, three hundred thirteen million, twelve thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •