Base | Representation |
---|---|
bin | 1001000110111100111110… |
… | …1100100101111101111101 |
3 | 1022110102121021202011222112 |
4 | 2101233033230211331331 |
5 | 2303041312123344131 |
6 | 33144504010223405 |
7 | 2052364233543434 |
oct | 221571754457575 |
9 | 38412537664875 |
10 | 10015053340541 |
11 | 32113a6578627 |
12 | 1158b99124b65 |
13 | 578552a5c312 |
14 | 268a3447a11b |
15 | 1257ab79202b |
hex | 91bcfb25f7d |
10015053340541 has 2 divisors, whose sum is σ = 10015053340542. Its totient is φ = 10015053340540.
The previous prime is 10015053340531. The next prime is 10015053340561. The reversal of 10015053340541 is 14504335051001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7184297565316 + 2830755775225 = 2680354^2 + 1682485^2 .
It is a cyclic number.
It is not a de Polignac number, because 10015053340541 - 218 = 10015053078397 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10015053340498 and 10015053340507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10015053340531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5007526670270 + 5007526670271.
It is an arithmetic number, because the mean of its divisors is an integer number (5007526670271).
Almost surely, 210015053340541 is an apocalyptic number.
It is an amenable number.
10015053340541 is a deficient number, since it is larger than the sum of its proper divisors (1).
10015053340541 is an equidigital number, since it uses as much as digits as its factorization.
10015053340541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 10015053340541 its reverse (14504335051001), we get a palindrome (24519388391542).
The spelling of 10015053340541 in words is "ten trillion, fifteen billion, fifty-three million, three hundred forty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •