Base | Representation |
---|---|
bin | 1001001000011111100001… |
… | …0111001111100110001101 |
3 | 1022112221212202222201110001 |
4 | 2102013320113033212031 |
5 | 2304010000341213032 |
6 | 33205000502044301 |
7 | 2054321602500634 |
oct | 222077027174615 |
9 | 38487782881401 |
10 | 10041505413517 |
11 | 322164002a566 |
12 | 116213ba19691 |
13 | 57abaa0770c6 |
14 | 26a02360c51b |
15 | 126308b933e7 |
hex | 921f85cf98d |
10041505413517 has 2 divisors, whose sum is σ = 10041505413518. Its totient is φ = 10041505413516.
The previous prime is 10041505413473. The next prime is 10041505413551. The reversal of 10041505413517 is 71531450514001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9767462586436 + 274042827081 = 3125294^2 + 523491^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10041505413517 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10041505413557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5020752706758 + 5020752706759.
It is an arithmetic number, because the mean of its divisors is an integer number (5020752706759).
Almost surely, 210041505413517 is an apocalyptic number.
It is an amenable number.
10041505413517 is a deficient number, since it is larger than the sum of its proper divisors (1).
10041505413517 is an equidigital number, since it uses as much as digits as its factorization.
10041505413517 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42000, while the sum is 37.
Adding to 10041505413517 its reverse (71531450514001), we get a palindrome (81572955927518).
The spelling of 10041505413517 in words is "ten trillion, forty-one billion, five hundred five million, four hundred thirteen thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •