Base | Representation |
---|---|
bin | 1001100101110011010101… |
… | …1101000001001001100101 |
3 | 1101100002121001222210112111 |
4 | 2121130311131001021211 |
5 | 2340232221111323023 |
6 | 34232154124121021 |
7 | 2135565646632412 |
oct | 231346535011145 |
9 | 41302531883474 |
10 | 10545041511013 |
11 | 33a614402a389 |
12 | 1223849096171 |
13 | 5b651598c959 |
14 | 286550309109 |
15 | 134479e6400d |
hex | 99735741265 |
10545041511013 has 2 divisors, whose sum is σ = 10545041511014. Its totient is φ = 10545041511012.
The previous prime is 10545041510959. The next prime is 10545041511049. The reversal of 10545041511013 is 31011514054501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8286925204804 + 2258116306209 = 2878702^2 + 1502703^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10545041511013 is a prime.
It is a super-2 number, since 2×105450415110132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10545041511413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5272520755506 + 5272520755507.
It is an arithmetic number, because the mean of its divisors is an integer number (5272520755507).
Almost surely, 210545041511013 is an apocalyptic number.
It is an amenable number.
10545041511013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10545041511013 is an equidigital number, since it uses as much as digits as its factorization.
10545041511013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6000, while the sum is 31.
Adding to 10545041511013 its reverse (31011514054501), we get a palindrome (41556555565514).
The spelling of 10545041511013 in words is "ten trillion, five hundred forty-five billion, forty-one million, five hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •