Base | Representation |
---|---|
bin | 1001011001010011011100… |
… | …0100100110110100000111 |
3 | 1100120120100210011011202102 |
4 | 2112110313010212310013 |
5 | 2323222443444120234 |
6 | 33545403355302315 |
7 | 2114224652520614 |
oct | 226246704466407 |
9 | 40516323134672 |
10 | 10330320301319 |
11 | 3323078554487 |
12 | 11aa10344a99b |
13 | 59c1b6807615 |
14 | 279dc105550b |
15 | 12daae3e9c7e |
hex | 96537126d07 |
10330320301319 has 2 divisors, whose sum is σ = 10330320301320. Its totient is φ = 10330320301318.
The previous prime is 10330320301289. The next prime is 10330320301333. The reversal of 10330320301319 is 91310302303301.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (91310302303301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10330320301319 - 224 = 10330303524103 is a prime.
It is a super-2 number, since 2×103303203013192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10330320301291 and 10330320301300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10330320901319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5165160150659 + 5165160150660.
It is an arithmetic number, because the mean of its divisors is an integer number (5165160150660).
Almost surely, 210330320301319 is an apocalyptic number.
10330320301319 is a deficient number, since it is larger than the sum of its proper divisors (1).
10330320301319 is an equidigital number, since it uses as much as digits as its factorization.
10330320301319 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4374, while the sum is 29.
The spelling of 10330320301319 in words is "ten trillion, three hundred thirty billion, three hundred twenty million, three hundred one thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •