Base | Representation |
---|---|
bin | 1001001000111111001101… |
… | …00111101001100000011101 |
3 | 2122011112200000212102120221 |
4 | 10210133212213221200131 |
5 | 10113304320402200133 |
6 | 110425453334041341 |
7 | 4143115155430435 |
oct | 444374647514035 |
9 | 78145600772527 |
10 | 20100021131293 |
11 | 644a409a16414 |
12 | 23076284a9251 |
13 | b2a5682b17ac |
14 | 4d6bbc01d2c5 |
15 | 24ccaad96a2d |
hex | 1247e69e981d |
20100021131293 has 2 divisors, whose sum is σ = 20100021131294. Its totient is φ = 20100021131292.
The previous prime is 20100021131207. The next prime is 20100021131321. The reversal of 20100021131293 is 39213112000102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16704116662489 + 3395904468804 = 4087067^2 + 1842798^2 .
It is a cyclic number.
It is not a de Polignac number, because 20100021131293 - 29 = 20100021130781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20100021131693) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050010565646 + 10050010565647.
It is an arithmetic number, because the mean of its divisors is an integer number (10050010565647).
Almost surely, 220100021131293 is an apocalyptic number.
It is an amenable number.
20100021131293 is a deficient number, since it is larger than the sum of its proper divisors (1).
20100021131293 is an equidigital number, since it uses as much as digits as its factorization.
20100021131293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 20100021131293 its reverse (39213112000102), we get a palindrome (59313133131395).
The spelling of 20100021131293 in words is "twenty trillion, one hundred billion, twenty-one million, one hundred thirty-one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •