Base | Representation |
---|---|
bin | 11110011010010000… |
… | …10011000110011101 |
3 | 1120010211000101102100 |
4 | 33031020103012131 |
5 | 231414030002212 |
6 | 11300015315313 |
7 | 1115404110636 |
oct | 171510230635 |
9 | 46124011370 |
10 | 16326406557 |
11 | 6a1891598a |
12 | 31b781bb39 |
13 | 170259b4c6 |
14 | b0c45a88d |
15 | 6584bdbdc |
hex | 3cd21319d |
16326406557 has 6 divisors (see below), whose sum is σ = 23582587262. Its totient is φ = 10884271032.
The previous prime is 16326406529. The next prime is 16326406559. The reversal of 16326406557 is 75560462361.
16326406557 is a `hidden beast` number, since 1 + 6 + 32 + 64 + 0 + 6 + 557 = 666.
16326406557 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 14290050681 + 2036355876 = 119541^2 + 45126^2 .
It is not a de Polignac number, because 16326406557 - 27 = 16326406429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16326406559) 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 5 ways as a sum of consecutive naturals, for example, 907022578 + ... + 907022595.
Almost surely, 216326406557 is an apocalyptic number.
It is an amenable number.
16326406557 is a deficient number, since it is larger than the sum of its proper divisors (7256180705).
16326406557 is a wasteful number, since it uses less digits than its factorization.
16326406557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1814045179 (or 1814045176 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 45.
The spelling of 16326406557 in words is "sixteen billion, three hundred twenty-six million, four hundred six thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •