Base | Representation |
---|---|
bin | 11110111010110110… |
… | …01011001000000001 |
3 | 1120211212102201010001 |
4 | 33131123023020001 |
5 | 232444021240311 |
6 | 11343103040001 |
7 | 1125233613310 |
oct | 173533131001 |
9 | 46755381101 |
10 | 16599790081 |
11 | 704916aa86 |
12 | 32732a0001 |
13 | 174710a3c4 |
14 | b368a2277 |
15 | 6724c14c1 |
hex | 3dd6cb201 |
16599790081 has 8 divisors (see below), whose sum is σ = 19374831360. Its totient is φ = 13925659488.
The previous prime is 16599790033. The next prime is 16599790139. The reversal of 16599790081 is 18009799561.
16599790081 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 16599790081 - 215 = 16599757313 is a prime.
It is a super-2 number, since 2×165997900812 (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 (16599700081) 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, 25227316 + ... + 25227973.
It is an arithmetic number, because the mean of its divisors is an integer number (2421853920).
Almost surely, 216599790081 is an apocalyptic number.
It is an amenable number.
16599790081 is a deficient number, since it is larger than the sum of its proper divisors (2775041279).
16599790081 is an equidigital number, since it uses as much as digits as its factorization.
16599790081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50455343.
The product of its (nonzero) digits is 1224720, while the sum is 55.
The spelling of 16599790081 in words is "sixteen billion, five hundred ninety-nine million, seven hundred ninety thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •