Base | Representation |
---|---|
bin | 1001001001000011010011… |
… | …0111101111100011110001 |
3 | 1022120212200011122200212211 |
4 | 2102100310313233203301 |
5 | 2304134133242004333 |
6 | 33213225540252121 |
7 | 2055111613416151 |
oct | 222206467574361 |
9 | 38525604580784 |
10 | 10051110500593 |
11 | 3225719933658 |
12 | 1163b806a1041 |
13 | 57ba7acb4596 |
14 | 26a695132761 |
15 | 1266bc044ecd |
hex | 92434def8f1 |
10051110500593 has 2 divisors, whose sum is σ = 10051110500594. Its totient is φ = 10051110500592.
The previous prime is 10051110500573. The next prime is 10051110500623. The reversal of 10051110500593 is 39500501115001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9814736591104 + 236373909489 = 3132848^2 + 486183^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10051110500593 is a prime.
It is not a weakly prime, because it can be changed into another prime (10051110500573) 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, 5025555250296 + 5025555250297.
It is an arithmetic number, because the mean of its divisors is an integer number (5025555250297).
Almost surely, 210051110500593 is an apocalyptic number.
It is an amenable number.
10051110500593 is a deficient number, since it is larger than the sum of its proper divisors (1).
10051110500593 is an equidigital number, since it uses as much as digits as its factorization.
10051110500593 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3375, while the sum is 31.
Adding to 10051110500593 its reverse (39500501115001), we get a palindrome (49551611615594).
The spelling of 10051110500593 in words is "ten trillion, fifty-one billion, one hundred ten million, five hundred thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •