Base | Representation |
---|---|
bin | 1001010010111100001110… |
… | …1110110000101000101001 |
3 | 1100012010012211102221111111 |
4 | 2110233003232300220221 |
5 | 2314430112304342022 |
6 | 33423245002030321 |
7 | 2103305116062412 |
oct | 224570356605051 |
9 | 40163184387444 |
10 | 10221011012137 |
11 | 3290785289662 |
12 | 1190a97aa83a1 |
13 | 591ab6446953 |
14 | 2749b18ac809 |
15 | 12ad12c8c477 |
hex | 94bc3bb0a29 |
10221011012137 has 2 divisors, whose sum is σ = 10221011012138. Its totient is φ = 10221011012136.
The previous prime is 10221011012083. The next prime is 10221011012141. The reversal of 10221011012137 is 73121011012201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7661846144016 + 2559164868121 = 2768004^2 + 1599739^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221011012137 - 239 = 9671255198249 is a prime.
It is a super-3 number, since 3×102210110121373 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (10221011012237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110505506068 + 5110505506069.
It is an arithmetic number, because the mean of its divisors is an integer number (5110505506069).
Almost surely, 210221011012137 is an apocalyptic number.
It is an amenable number.
10221011012137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221011012137 is an equidigital number, since it uses as much as digits as its factorization.
10221011012137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 22.
Adding to 10221011012137 its reverse (73121011012201), we get a palindrome (83342022024338).
The spelling of 10221011012137 in words is "ten trillion, two hundred twenty-one billion, eleven million, twelve thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •