Base | Representation |
---|---|
bin | 11110011010110000… |
… | …10100101000011101 |
3 | 1120011002220210112020 |
4 | 33031120110220131 |
5 | 231421113412013 |
6 | 11300245330353 |
7 | 1115454604341 |
oct | 171530245035 |
9 | 46132823466 |
10 | 16330607133 |
11 | 6a20224935 |
12 | 31b91069b9 |
13 | 170340c459 |
14 | b0cc31621 |
15 | 658a4d623 |
hex | 3cd614a1d |
16330607133 has 8 divisors (see below), whose sum is σ = 23054974848. Its totient is φ = 10246655424.
The previous prime is 16330607101. The next prime is 16330607143. The reversal of 16330607133 is 33170603361.
16330607133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16330607133 - 25 = 16330607101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16330607094 and 16330607103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16330607143) 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 7 ways as a sum of consecutive naturals, for example, 160103941 + ... + 160104042.
It is an arithmetic number, because the mean of its divisors is an integer number (2881871856).
Almost surely, 216330607133 is an apocalyptic number.
It is an amenable number.
16330607133 is a deficient number, since it is larger than the sum of its proper divisors (6724367715).
16330607133 is a wasteful number, since it uses less digits than its factorization.
16330607133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320208003.
The product of its (nonzero) digits is 20412, while the sum is 33.
The spelling of 16330607133 in words is "sixteen billion, three hundred thirty million, six hundred seven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •