Base | Representation |
---|---|
bin | 1001011001010010010010… |
… | …1001100001100100100111 |
3 | 1100120112120020112211000111 |
4 | 2112110210221201210213 |
5 | 2323221330332241241 |
6 | 33545312554353451 |
7 | 2114214210354025 |
oct | 226244451414447 |
9 | 40515506484014 |
10 | 10330011212071 |
11 | 3322a2a032121 |
12 | 11aa037a2b887 |
13 | 59c167776685 |
14 | 279d91d97715 |
15 | 12da921e2c81 |
hex | 96524a61927 |
10330011212071 has 2 divisors, whose sum is σ = 10330011212072. Its totient is φ = 10330011212070.
The previous prime is 10330011212011. The next prime is 10330011212083. The reversal of 10330011212071 is 17021211003301.
It is a strong prime.
It is an emirp because it is prime and its reverse (17021211003301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10330011212071 - 215 = 10330011179303 is a prime.
It is a super-2 number, since 2×103300112120712 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10330011212011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5165005606035 + 5165005606036.
It is an arithmetic number, because the mean of its divisors is an integer number (5165005606036).
Almost surely, 210330011212071 is an apocalyptic number.
10330011212071 is a deficient number, since it is larger than the sum of its proper divisors (1).
10330011212071 is an equidigital number, since it uses as much as digits as its factorization.
10330011212071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 22.
Adding to 10330011212071 its reverse (17021211003301), we get a palindrome (27351222215372).
The spelling of 10330011212071 in words is "ten trillion, three hundred thirty billion, eleven million, two hundred twelve thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •