Base | Representation |
---|---|
bin | 10011011001100100… |
… | …001001010000000101 |
3 | 1222202200022122101102 |
4 | 103121210021100011 |
5 | 320124440001013 |
6 | 13322535105445 |
7 | 1335121036235 |
oct | 233144112005 |
9 | 58680278342 |
10 | 20830000133 |
11 | 8919aa0448 |
12 | 4053b12285 |
13 | 1c6c632887 |
14 | 101861dcc5 |
15 | 81da6bd58 |
hex | 4d9909405 |
20830000133 has 16 divisors (see below), whose sum is σ = 21142892160. Its totient is φ = 20519606016.
The previous prime is 20830000109. The next prime is 20830000157. The reversal of 20830000133 is 33100003802.
It is an interprime number because it is at equal distance from previous prime (20830000109) and next prime (20830000157).
It is a cyclic number.
It is not a de Polignac number, because 20830000133 - 26 = 20830000069 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 (20830000733) 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 15 ways as a sum of consecutive naturals, for example, 25747433 + ... + 25748241.
It is an arithmetic number, because the mean of its divisors is an integer number (1321430760).
Almost surely, 220830000133 is an apocalyptic number.
20830000133 is the 83327-th octagonal number.
It is an amenable number.
20830000133 is a deficient number, since it is larger than the sum of its proper divisors (312892027).
20830000133 is a wasteful number, since it uses less digits than its factorization.
20830000133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1916.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20830000133 its reverse (33100003802), we get a palindrome (53930003935).
The spelling of 20830000133 in words is "twenty billion, eight hundred thirty million, one hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •