Base | Representation |
---|---|
bin | 1001001011111111000011… |
… | …11001110001110110100101 |
3 | 2122112101112021200201101101 |
4 | 10211333201321301312211 |
5 | 10122001241412304333 |
6 | 110545050111200101 |
7 | 4153422461612215 |
oct | 445774171616645 |
9 | 78471467621341 |
10 | 20203021213093 |
11 | 648a064868364 |
12 | 2323592b16031 |
13 | b371a1503a64 |
14 | 4dbb8d6a8245 |
15 | 2507d868e67d |
hex | 125fe1e71da5 |
20203021213093 has 2 divisors, whose sum is σ = 20203021213094. Its totient is φ = 20203021213092.
The previous prime is 20203021213051. The next prime is 20203021213117. The reversal of 20203021213093 is 39031212030202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15609192017409 + 4593829195684 = 3950847^2 + 2143322^2 .
It is a cyclic number.
It is not a de Polignac number, because 20203021213093 - 225 = 20202987658661 is a prime.
It is a super-2 number, since 2×202030212130932 (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 (20203021213033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10101510606546 + 10101510606547.
It is an arithmetic number, because the mean of its divisors is an integer number (10101510606547).
Almost surely, 220203021213093 is an apocalyptic number.
It is an amenable number.
20203021213093 is a deficient number, since it is larger than the sum of its proper divisors (1).
20203021213093 is an equidigital number, since it uses as much as digits as its factorization.
20203021213093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 20203021213093 its reverse (39031212030202), we get a palindrome (59234233243295).
The spelling of 20203021213093 in words is "twenty trillion, two hundred three billion, twenty-one million, two hundred thirteen thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •