Base | Representation |
---|---|
bin | 10010110000000010… |
… | …100001100100101001 |
3 | 1220222010101200021121 |
4 | 102300002201210221 |
5 | 312213112233001 |
6 | 13125450535241 |
7 | 1311631255603 |
oct | 226002414451 |
9 | 56863350247 |
10 | 20133321001 |
11 | 85a180a072 |
12 | 3a9a737521 |
13 | 1b8b1b6bc1 |
14 | d8dcac173 |
15 | 7cc8036a1 |
hex | 4b00a1929 |
20133321001 has 4 divisors (see below), whose sum is σ = 20186443600. Its totient is φ = 20080198404.
The previous prime is 20133320989. The next prime is 20133321031. The reversal of 20133321001 is 10012333102.
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: 10012333102 = 2 ⋅5006166551.
It is a cyclic number.
It is not a de Polignac number, because 20133321001 - 217 = 20133189929 is a prime.
It is a super-2 number, since 2×201333210012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20133321031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26560731 + ... + 26561488.
It is an arithmetic number, because the mean of its divisors is an integer number (5046610900).
Almost surely, 220133321001 is an apocalyptic number.
It is an amenable number.
20133321001 is a deficient number, since it is larger than the sum of its proper divisors (53122599).
20133321001 is an equidigital number, since it uses as much as digits as its factorization.
20133321001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53122598.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 20133321001 its reverse (10012333102), we get a palindrome (30145654103).
The spelling of 20133321001 in words is "twenty billion, one hundred thirty-three million, three hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •