Base | Representation |
---|---|
bin | 1001000110111100111110… |
… | …1100000101000000100101 |
3 | 1022110102121021111022210112 |
4 | 2101233033230011000211 |
5 | 2303041312110034131 |
6 | 33144504003302405 |
7 | 2052364232442026 |
oct | 221571754050045 |
9 | 38412537438715 |
10 | 10015053205541 |
11 | 32113a649615a |
12 | 1158b9907aa05 |
13 | 578552a12a37 |
14 | 268a34442c4d |
15 | 1257ab76702b |
hex | 91bcfb05025 |
10015053205541 has 2 divisors, whose sum is σ = 10015053205542. Its totient is φ = 10015053205540.
The previous prime is 10015053205499. The next prime is 10015053205571. The reversal of 10015053205541 is 14550235051001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5182292896225 + 4832760309316 = 2276465^2 + 2198354^2 .
It is a cyclic number.
It is not a de Polignac number, because 10015053205541 - 218 = 10015052943397 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10015053205498 and 10015053205507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10015053205571) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5007526602770 + 5007526602771.
It is an arithmetic number, because the mean of its divisors is an integer number (5007526602771).
Almost surely, 210015053205541 is an apocalyptic number.
It is an amenable number.
10015053205541 is a deficient number, since it is larger than the sum of its proper divisors (1).
10015053205541 is an equidigital number, since it uses as much as digits as its factorization.
10015053205541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15000, while the sum is 32.
Adding to 10015053205541 its reverse (14550235051001), we get a palindrome (24565288256542).
The spelling of 10015053205541 in words is "ten trillion, fifteen billion, fifty-three million, two hundred five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •