Base | Representation |
---|---|
bin | 10010111011111000… |
… | …100000010110001101 |
3 | 1221110222021200121202 |
4 | 102323320200112031 |
5 | 313114444134013 |
6 | 13201305435245 |
7 | 1316563220354 |
oct | 227370402615 |
9 | 57428250552 |
10 | 20332021133 |
11 | 8693994456 |
12 | 3b3519bb25 |
13 | 1bc0407648 |
14 | dac43299b |
15 | 7deea2858 |
hex | 4bbe2058d |
20332021133 has 4 divisors (see below), whose sum is σ = 21033125340. Its totient is φ = 19630916928.
The previous prime is 20332021109. The next prime is 20332021139. The reversal of 20332021133 is 33112023302.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3638864329 + 16693156804 = 60323^2 + 129202^2 .
It is a cyclic number.
It is not a de Polignac number, because 20332021133 - 216 = 20331955597 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20332021139) 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 in 3 ways as a sum of consecutive naturals, for example, 350552060 + ... + 350552117.
It is an arithmetic number, because the mean of its divisors is an integer number (5258281335).
Almost surely, 220332021133 is an apocalyptic number.
It is an amenable number.
20332021133 is a deficient number, since it is larger than the sum of its proper divisors (701104207).
20332021133 is an equidigital number, since it uses as much as digits as its factorization.
20332021133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701104206.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 20332021133 its reverse (33112023302), we get a palindrome (53444044435).
The spelling of 20332021133 in words is "twenty billion, three hundred thirty-two million, twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •