Base | Representation |
---|---|
bin | 1001010001101110000000… |
… | …0010111011000100000101 |
3 | 1100010010000022122010210121 |
4 | 2110123200002323010011 |
5 | 2314104110333121201 |
6 | 33405453115421541 |
7 | 2101632533604304 |
oct | 224334002730405 |
9 | 40103008563717 |
10 | 10200011223301 |
11 | 3282889470479 |
12 | 11889b71548b1 |
13 | 58cb1a8a6cb3 |
14 | 27397c8d243b |
15 | 12a4d43829a1 |
hex | 946e00bb105 |
10200011223301 has 2 divisors, whose sum is σ = 10200011223302. Its totient is φ = 10200011223300.
The previous prime is 10200011223239. The next prime is 10200011223329. The reversal of 10200011223301 is 10332211000201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9217387080225 + 982624143076 = 3036015^2 + 991274^2 .
It is a cyclic number.
It is not a de Polignac number, because 10200011223301 - 29 = 10200011222789 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10200011223371) 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, 5100005611650 + 5100005611651.
It is an arithmetic number, because the mean of its divisors is an integer number (5100005611651).
Almost surely, 210200011223301 is an apocalyptic number.
It is an amenable number.
10200011223301 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200011223301 is an equidigital number, since it uses as much as digits as its factorization.
10200011223301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10200011223301 its reverse (10332211000201), we get a palindrome (20532222223502).
The spelling of 10200011223301 in words is "ten trillion, two hundred billion, eleven million, two hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •