Base | Representation |
---|---|
bin | 1001000110011001100000… |
… | …0100011010010010000001 |
3 | 1022102112000121010201210011 |
4 | 2101212120010122102001 |
5 | 2302412311203003231 |
6 | 33140251014504521 |
7 | 2051606235546064 |
oct | 221463004322201 |
9 | 38375017121704 |
10 | 10005530125441 |
11 | 3208359a04124 |
12 | 115717b965141 |
13 | 577695a892b6 |
14 | 2683ad7888db |
15 | 1254006b39b1 |
hex | 9199811a481 |
10005530125441 has 2 divisors, whose sum is σ = 10005530125442. Its totient is φ = 10005530125440.
The previous prime is 10005530125399. The next prime is 10005530125447. The reversal of 10005530125441 is 14452103550001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9930508915441 + 75021210000 = 3151271^2 + 273900^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10005530125441 is a prime.
It is a super-2 number, since 2×100055301254412 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10005530125447) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5002765062720 + 5002765062721.
It is an arithmetic number, because the mean of its divisors is an integer number (5002765062721).
Almost surely, 210005530125441 is an apocalyptic number.
It is an amenable number.
10005530125441 is a deficient number, since it is larger than the sum of its proper divisors (1).
10005530125441 is an equidigital number, since it uses as much as digits as its factorization.
10005530125441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 10005530125441 its reverse (14452103550001), we get a palindrome (24457633675442).
The spelling of 10005530125441 in words is "ten trillion, five billion, five hundred thirty million, one hundred twenty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •