Base | Representation |
---|---|
bin | 10010101111101001… |
… | …11100111101000001 |
3 | 221222100010101120122 |
4 | 21113310330331001 |
5 | 131102214333122 |
6 | 4342330150025 |
7 | 504244526243 |
oct | 112764747501 |
9 | 27870111518 |
10 | 10063433537 |
11 | 42a4600623 |
12 | 1b4a282315 |
13 | c44b9a201 |
14 | 6b6756093 |
15 | 3dd73d142 |
hex | 257d3cf41 |
10063433537 has 2 divisors, whose sum is σ = 10063433538. Its totient is φ = 10063433536.
The previous prime is 10063433473. The next prime is 10063433539. The reversal of 10063433537 is 73533436001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9407254081 + 656179456 = 96991^2 + 25616^2 .
It is a cyclic number.
It is not a de Polignac number, because 10063433537 - 26 = 10063433473 is a prime.
Together with 10063433539, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 10063433497 and 10063433506.
It is not a weakly prime, because it can be changed into another prime (10063433539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5031716768 + 5031716769.
It is an arithmetic number, because the mean of its divisors is an integer number (5031716769).
Almost surely, 210063433537 is an apocalyptic number.
It is an amenable number.
10063433537 is a deficient number, since it is larger than the sum of its proper divisors (1).
10063433537 is an equidigital number, since it uses as much as digits as its factorization.
10063433537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 35.
Adding to 10063433537 its reverse (73533436001), we get a palindrome (83596869538).
The spelling of 10063433537 in words is "ten billion, sixty-three million, four hundred thirty-three thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •