Base | Representation |
---|---|
bin | 1001011001010011011010… |
… | …1101000010101100000101 |
3 | 1100120120100100112100010012 |
4 | 2112110312231002230011 |
5 | 2323222440403432122 |
6 | 33545403015040005 |
7 | 2114224546152215 |
oct | 226246655025405 |
9 | 40516310470105 |
10 | 10330314124037 |
11 | 3323075015396 |
12 | 11aa101370005 |
13 | 59c1b5453a1b |
14 | 279dc02c8245 |
15 | 12daadac97e2 |
hex | 96536b42b05 |
10330314124037 has 2 divisors, whose sum is σ = 10330314124038. Its totient is φ = 10330314124036.
The previous prime is 10330314124003. The next prime is 10330314124061. The reversal of 10330314124037 is 73042141303301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8158386851521 + 2171927272516 = 2856289^2 + 1473746^2 .
It is a cyclic number.
It is not a de Polignac number, because 10330314124037 - 222 = 10330309929733 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10330314123994 and 10330314124012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10330314124337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5165157062018 + 5165157062019.
It is an arithmetic number, because the mean of its divisors is an integer number (5165157062019).
Almost surely, 210330314124037 is an apocalyptic number.
It is an amenable number.
10330314124037 is a deficient number, since it is larger than the sum of its proper divisors (1).
10330314124037 is an equidigital number, since it uses as much as digits as its factorization.
10330314124037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18144, while the sum is 32.
Adding to 10330314124037 its reverse (73042141303301), we get a palindrome (83372455427338).
The spelling of 10330314124037 in words is "ten trillion, three hundred thirty billion, three hundred fourteen million, one hundred twenty-four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •