Base | Representation |
---|---|
bin | 10010101000001001… |
… | …110110000001010001 |
3 | 1220121220110012012211 |
4 | 102220021312001101 |
5 | 311430230201113 |
6 | 13104403152121 |
7 | 1305433611406 |
oct | 225011660121 |
9 | 56556405184 |
10 | 20001022033 |
11 | 8534067983 |
12 | 3a62375641 |
13 | 1b69974ba5 |
14 | d7a4b02ad |
15 | 7c0dbdb3d |
hex | 4a8276051 |
20001022033 has 4 divisors (see below), whose sum is σ = 20120788800. Its totient is φ = 19881255268.
The previous prime is 20001021961. The next prime is 20001022043. The reversal of 20001022033 is 33022010002.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 33022010002 = 2 ⋅16511005001.
It is a cyclic number.
It is not a de Polignac number, because 20001022033 - 225 = 19967467601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20001022043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 59883133 + ... + 59883466.
It is an arithmetic number, because the mean of its divisors is an integer number (5030197200).
Almost surely, 220001022033 is an apocalyptic number.
It is an amenable number.
20001022033 is a deficient number, since it is larger than the sum of its proper divisors (119766767).
20001022033 is a wasteful number, since it uses less digits than its factorization.
20001022033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119766766.
The product of its (nonzero) digits is 72, while the sum is 13.
Adding to 20001022033 its reverse (33022010002), we get a palindrome (53023032035).
The spelling of 20001022033 in words is "twenty billion, one million, twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •