Base | Representation |
---|---|
bin | 11101111000010110… |
… | …10110110110000001 |
3 | 1112101222211211000000 |
4 | 32330023112312001 |
5 | 230323222330044 |
6 | 11211455350213 |
7 | 1105351466421 |
oct | 167413266601 |
9 | 45358754000 |
10 | 16041995649 |
11 | 6892319849 |
12 | 3138522369 |
13 | 168869b224 |
14 | ac2784481 |
15 | 63d53dd69 |
hex | 3bc2d6d81 |
16041995649 has 21 divisors (see below), whose sum is σ = 24057119089. Its totient is φ = 10692383940.
The previous prime is 16041995647. The next prime is 16041995689. The reversal of 16041995649 is 94659914061.
The square root of 16041995649 is 126657.
It is a perfect power (a square), and thus also a powerful number.
16041995649 is a `hidden beast` number, since 1 + 60 + 4 + 19 + 9 + 564 + 9 = 666.
It is not a de Polignac number, because 16041995649 - 21 = 16041995647 is a prime.
It is a super-3 number, since 3×160419956493 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16041995595 and 16041995604.
It is not an unprimeable number, because it can be changed into a prime (16041995647) by changing a digit.
It is a polite number, since it can be written in 20 ways as a sum of consecutive naturals, for example, 3417394 + ... + 3422084.
Almost surely, 216041995649 is an apocalyptic number.
16041995649 is the 126657-th square number.
16041995649 is the 63329-th centered octagonal number.
It is an amenable number.
16041995649 is a deficient number, since it is larger than the sum of its proper divisors (8015123440).
16041995649 is an frugal number, since it uses more digits than its factorization.
16041995649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9400 (or 4694 counting only the distinct ones).
The product of its (nonzero) digits is 2099520, while the sum is 54.
The spelling of 16041995649 in words is "sixteen billion, forty-one million, nine hundred ninety-five thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •