Base | Representation |
---|---|
bin | 11110111000001100… |
… | …11100000001011011 |
3 | 1120210022122011120020 |
4 | 33130012130001123 |
5 | 232422324431201 |
6 | 11340551001523 |
7 | 1124544036300 |
oct | 173406340133 |
9 | 46708564506 |
10 | 16577577051 |
11 | 7037679002 |
12 | 32679692a3 |
13 | 17426308b9 |
14 | b3395d0a7 |
15 | 670584a36 |
hex | 3dc19c05b |
16577577051 has 24 divisors (see below), whose sum is σ = 26407092240. Its totient is φ = 9216873792.
The previous prime is 16577577031. The next prime is 16577577059. The reversal of 16577577051 is 15077577561.
16577577051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 16577577051 - 27 = 16577576923 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16577576985 and 16577577003.
It is not an unprimeable number, because it can be changed into a prime (16577577059) 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 23 ways as a sum of consecutive naturals, for example, 1518516 + ... + 1529393.
It is an arithmetic number, because the mean of its divisors is an integer number (1100295510).
Almost surely, 216577577051 is an apocalyptic number.
16577577051 is a deficient number, since it is larger than the sum of its proper divisors (9829515189).
16577577051 is a wasteful number, since it uses less digits than its factorization.
16577577051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3047963 (or 3047956 counting only the distinct ones).
The product of its (nonzero) digits is 1800750, while the sum is 51.
The spelling of 16577577051 in words is "sixteen billion, five hundred seventy-seven million, five hundred seventy-seven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •