Base | Representation |
---|---|
bin | 10011010010001110… |
… | …01100111000010101 |
3 | 222201112210201222202 |
4 | 21221013030320111 |
5 | 132200434230122 |
6 | 4431205534245 |
7 | 514365463136 |
oct | 115107147025 |
9 | 28645721882 |
10 | 10353430037 |
11 | 4433272255 |
12 | 200b414385 |
13 | c8cca4982 |
14 | 703083c8d |
15 | 408e22e92 |
hex | 2691cce15 |
10353430037 has 2 divisors, whose sum is σ = 10353430038. Its totient is φ = 10353430036.
The previous prime is 10353430019. The next prime is 10353430039. The reversal of 10353430037 is 73003435301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10141698436 + 211731601 = 100706^2 + 14551^2 .
It is an emirp because it is prime and its reverse (73003435301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10353430037 - 210 = 10353429013 is a prime.
Together with 10353430039, 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 = 10353429991 and 10353430009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10353430039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5176715018 + 5176715019.
It is an arithmetic number, because the mean of its divisors is an integer number (5176715019).
Almost surely, 210353430037 is an apocalyptic number.
It is an amenable number.
10353430037 is a deficient number, since it is larger than the sum of its proper divisors (1).
10353430037 is an equidigital number, since it uses as much as digits as its factorization.
10353430037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11340, while the sum is 29.
Adding to 10353430037 its reverse (73003435301), we get a palindrome (83356865338).
The spelling of 10353430037 in words is "ten billion, three hundred fifty-three million, four hundred thirty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •