Base | Representation |
---|---|
bin | 1001000110000110110001… |
… | …01100010011000000101001 |
3 | 2121211002002022012102012022 |
4 | 10203003120230103000221 |
5 | 10110144023311033113 |
6 | 110312200052354225 |
7 | 4133011335166352 |
oct | 443033054230051 |
9 | 77732068172168 |
10 | 20001003221033 |
11 | 641141799092a |
12 | 22b03b3615975 |
13 | b211180ab053 |
14 | 4d20a75a6d29 |
15 | 24a412ea1908 |
hex | 1230d8b13029 |
20001003221033 has 2 divisors, whose sum is σ = 20001003221034. Its totient is φ = 20001003221032.
The previous prime is 20001003221011. The next prime is 20001003221113. The reversal of 20001003221033 is 33012230010002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17650644405289 + 2350358815744 = 4201267^2 + 1533088^2 .
It is a cyclic number.
It is not a de Polignac number, because 20001003221033 - 220 = 20001002172457 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (20001003281033) 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, 10000501610516 + 10000501610517.
It is an arithmetic number, because the mean of its divisors is an integer number (10000501610517).
Almost surely, 220001003221033 is an apocalyptic number.
It is an amenable number.
20001003221033 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001003221033 is an equidigital number, since it uses as much as digits as its factorization.
20001003221033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 20001003221033 its reverse (33012230010002), we get a palindrome (53013233231035).
The spelling of 20001003221033 in words is "twenty trillion, one billion, three million, two hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •