Base | Representation |
---|---|
bin | 1001000111010011111000… |
… | …0100100111111011100101 |
3 | 1022111000110122221222021202 |
4 | 2101310332010213323211 |
5 | 2303141404211213333 |
6 | 33151401544452245 |
7 | 2053002452260226 |
oct | 221647604477345 |
9 | 38430418858252 |
10 | 10021200101093 |
11 | 3213a70228825 |
12 | 115a21377a085 |
13 | 578cc236163c |
14 | 26905896d24d |
15 | 125a1b2195e8 |
hex | 91d3e127ee5 |
10021200101093 has 2 divisors, whose sum is σ = 10021200101094. Its totient is φ = 10021200101092.
The previous prime is 10021200100979. The next prime is 10021200101117. The reversal of 10021200101093 is 39010100212001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9070415194369 + 950784906724 = 3011713^2 + 975082^2 .
It is a cyclic number.
It is not a de Polignac number, because 10021200101093 - 226 = 10021132992229 is a prime.
It is a super-2 number, since 2×100212001010932 (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 (10021200104093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010600050546 + 5010600050547.
It is an arithmetic number, because the mean of its divisors is an integer number (5010600050547).
Almost surely, 210021200101093 is an apocalyptic number.
It is an amenable number.
10021200101093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021200101093 is an equidigital number, since it uses as much as digits as its factorization.
10021200101093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 10021200101093 its reverse (39010100212001), we get a palindrome (49031300313094).
The spelling of 10021200101093 in words is "ten trillion, twenty-one billion, two hundred million, one hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •