Base | Representation |
---|---|
bin | 11110011001000101… |
… | …10100111000011001 |
3 | 1120010010112022122112 |
4 | 33030202310320121 |
5 | 231404021132244 |
6 | 11255025002105 |
7 | 1115224446065 |
oct | 171442647031 |
9 | 46103468575 |
10 | 16316583449 |
11 | 6a13316711 |
12 | 31b4483335 |
13 | 170053c30a |
14 | b0b020aa5 |
15 | 6576cd39e |
hex | 3cc8b4e19 |
16316583449 has 8 divisors (see below), whose sum is σ = 16525695360. Its totient is φ = 16107536016.
The previous prime is 16316583443. The next prime is 16316583467. The reversal of 16316583449 is 94438561361.
16316583449 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 a cyclic number.
It is not a de Polignac number, because 16316583449 - 212 = 16316579353 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16316583397 and 16316583406.
It is not an unprimeable number, because it can be changed into a prime (16316583443) 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, 688847 + ... + 712139.
It is an arithmetic number, because the mean of its divisors is an integer number (2065711920).
Almost surely, 216316583449 is an apocalyptic number.
It is an amenable number.
16316583449 is a deficient number, since it is larger than the sum of its proper divisors (209111911).
16316583449 is an equidigital number, since it uses as much as digits as its factorization.
16316583449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32239.
The product of its digits is 1866240, while the sum is 50.
The spelling of 16316583449 in words is "sixteen billion, three hundred sixteen million, five hundred eighty-three thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.356 sec. • engine limits •