Base | Representation |
---|---|
bin | 1001010001110001101100… |
… | …1010011000001001111101 |
3 | 1100010012120102220022020001 |
4 | 2110130123022120021331 |
5 | 2314113123234030323 |
6 | 33410135345354301 |
7 | 2101666236054346 |
oct | 224343312301175 |
9 | 40105512808201 |
10 | 10201003033213 |
11 | 32832482aa993 |
12 | 1189033338991 |
13 | 58cc48207375 |
14 | 273a3450b0cd |
15 | 12a5414973ad |
hex | 9471b29827d |
10201003033213 has 2 divisors, whose sum is σ = 10201003033214. Its totient is φ = 10201003033212.
The previous prime is 10201003033171. The next prime is 10201003033229. The reversal of 10201003033213 is 31233030010201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10200786413689 + 216619524 = 3193867^2 + 14718^2 .
It is a cyclic number.
It is not a de Polignac number, because 10201003033213 - 213 = 10201003025021 is a prime.
It is a super-2 number, since 2×102010030332132 (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 (10201003033313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100501516606 + 5100501516607.
It is an arithmetic number, because the mean of its divisors is an integer number (5100501516607).
Almost surely, 210201003033213 is an apocalyptic number.
It is an amenable number.
10201003033213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201003033213 is an equidigital number, since it uses as much as digits as its factorization.
10201003033213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 10201003033213 its reverse (31233030010201), we get a palindrome (41434033043414).
The spelling of 10201003033213 in words is "ten trillion, two hundred one billion, three million, thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •