Base | Representation |
---|---|
bin | 11110100010010010… |
… | …10001010110010111 |
3 | 1120022111202211020011 |
4 | 33101021101112113 |
5 | 232033301123031 |
6 | 11310423221051 |
7 | 1120152514645 |
oct | 172111212627 |
9 | 46274684204 |
10 | 16393770391 |
11 | 6a52946379 |
12 | 32162a7787 |
13 | 171352616b |
14 | b17394195 |
15 | 65e3786b1 |
hex | 3d1251597 |
16393770391 has 2 divisors, whose sum is σ = 16393770392. Its totient is φ = 16393770390.
The previous prime is 16393770389. The next prime is 16393770397. The reversal of 16393770391 is 19307739361.
16393770391 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 16393770391 - 21 = 16393770389 is a prime.
Together with 16393770389, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16393770397) 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 as a sum of consecutive naturals, namely, 8196885195 + 8196885196.
It is an arithmetic number, because the mean of its divisors is an integer number (8196885196).
Almost surely, 216393770391 is an apocalyptic number.
16393770391 is a deficient number, since it is larger than the sum of its proper divisors (1).
16393770391 is an equidigital number, since it uses as much as digits as its factorization.
16393770391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 642978, while the sum is 49.
The spelling of 16393770391 in words is "sixteen billion, three hundred ninety-three million, seven hundred seventy thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •