Base | Representation |
---|---|
bin | 10011011010001100… |
… | …11110111010000001 |
3 | 222220012201122201212 |
4 | 21231012132322001 |
5 | 132320102204333 |
6 | 4442000135505 |
7 | 516140342612 |
oct | 115506367201 |
9 | 28805648655 |
10 | 10420350593 |
11 | 446801a6a4 |
12 | 2029907595 |
13 | ca0b05933 |
14 | 70bd03c09 |
15 | 40ec41448 |
hex | 26d19ee81 |
10420350593 has 2 divisors, whose sum is σ = 10420350594. Its totient is φ = 10420350592.
The previous prime is 10420350587. The next prime is 10420350601. The reversal of 10420350593 is 39505302401.
10420350593 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10398288784 + 22061809 = 101972^2 + 4697^2 .
It is a cyclic number.
It is not a de Polignac number, because 10420350593 - 214 = 10420334209 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10420350503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5210175296 + 5210175297.
It is an arithmetic number, because the mean of its divisors is an integer number (5210175297).
Almost surely, 210420350593 is an apocalyptic number.
It is an amenable number.
10420350593 is a deficient number, since it is larger than the sum of its proper divisors (1).
10420350593 is an equidigital number, since it uses as much as digits as its factorization.
10420350593 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 32.
Adding to 10420350593 its reverse (39505302401), we get a palindrome (49925652994).
The spelling of 10420350593 in words is "ten billion, four hundred twenty million, three hundred fifty thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •