Base | Representation |
---|---|
bin | 1001011001010010010000… |
… | …1001100001110000010101 |
3 | 1100120112112122202200001002 |
4 | 2112110210021201300111 |
5 | 2323221321210333323 |
6 | 33545312054513045 |
7 | 2114214046150442 |
oct | 226244411416025 |
9 | 40515478680032 |
10 | 10330002824213 |
11 | 3322a25323206 |
12 | 11aa035065785 |
13 | 59c165aca847 |
14 | 279d90c129c9 |
15 | 12da915d7828 |
hex | 96524261c15 |
10330002824213 has 2 divisors, whose sum is σ = 10330002824214. Its totient is φ = 10330002824212.
The previous prime is 10330002824191. The next prime is 10330002824237. The reversal of 10330002824213 is 31242820003301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9192672291364 + 1137330532849 = 3031942^2 + 1066457^2 .
It is a cyclic number.
It is not a de Polignac number, because 10330002824213 - 242 = 5931956313109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10330002824243) 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, 5165001412106 + 5165001412107.
It is an arithmetic number, because the mean of its divisors is an integer number (5165001412107).
Almost surely, 210330002824213 is an apocalyptic number.
It is an amenable number.
10330002824213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10330002824213 is an equidigital number, since it uses as much as digits as its factorization.
10330002824213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 10330002824213 its reverse (31242820003301), we get a palindrome (41572822827514).
The spelling of 10330002824213 in words is "ten trillion, three hundred thirty billion, two million, eight hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •