Base | Representation |
---|---|
bin | 11110110011010110… |
… | …11000101110010000 |
3 | 1120200111011010221221 |
4 | 33121223120232100 |
5 | 232331423244331 |
6 | 11332535454424 |
7 | 1123541411311 |
oct | 173153305620 |
9 | 46614133857 |
10 | 16536931216 |
11 | 7016737203 |
12 | 3256227414 |
13 | 173709c100 |
14 | b2c3bc608 |
15 | 66bc06711 |
hex | 3d9ad8b90 |
16536931216 has 45 divisors (see below), whose sum is σ = 34708565619. Its totient is φ = 7629343488.
The previous prime is 16536931211. The next prime is 16536931277. The reversal of 16536931216 is 61213963561.
It is a happy number.
The square root of 16536931216 is 128596.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 295977616 + 16240953600 = 17204^2 + 127440^2 .
It is not an unprimeable number, because it can be changed into a prime (16536931211) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 6685756 + ... + 6688228.
Almost surely, 216536931216 is an apocalyptic number.
16536931216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
16536931216 is the 128596-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16536931216
16536931216 is an abundant number, since it is smaller than the sum of its proper divisors (18171634403).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16536931216 is an frugal number, since it uses more digits than its factorization.
16536931216 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4980 (or 2488 counting only the distinct ones).
The product of its digits is 174960, while the sum is 43.
The spelling of 16536931216 in words is "sixteen billion, five hundred thirty-six million, nine hundred thirty-one thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •