Base | Representation |
---|---|
bin | 11110111110101000… |
… | …11110111011110001 |
3 | 1120221002021100021120 |
4 | 33133110132323301 |
5 | 233030141400031 |
6 | 11350200412453 |
7 | 1126101121311 |
oct | 173724367361 |
9 | 46832240246 |
10 | 16631590641 |
11 | 7065110236 |
12 | 3281a77129 |
13 | 1750892ac3 |
14 | b3abbd441 |
15 | 6751a3a96 |
hex | 3df51eef1 |
16631590641 has 8 divisors (see below), whose sum is σ = 22593859200. Its totient is φ = 10878524592.
The previous prime is 16631590631. The next prime is 16631590643. The reversal of 16631590641 is 14609513661.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16631590641 - 213 = 16631582449 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 16631590593 and 16631590602.
It is not an unprimeable number, because it can be changed into a prime (16631590643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52300441 + ... + 52300758.
It is an arithmetic number, because the mean of its divisors is an integer number (2824232400).
Almost surely, 216631590641 is an apocalyptic number.
It is an amenable number.
16631590641 is a deficient number, since it is larger than the sum of its proper divisors (5962268559).
16631590641 is a wasteful number, since it uses less digits than its factorization.
16631590641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104601255.
The product of its (nonzero) digits is 116640, while the sum is 42.
The spelling of 16631590641 in words is "sixteen billion, six hundred thirty-one million, five hundred ninety thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •