Base | Representation |
---|---|
bin | 11110111110010110… |
… | …00111001100100100 |
3 | 1120220220122112120011 |
4 | 33133023013030210 |
5 | 233024024242431 |
6 | 11350032020004 |
7 | 1126041210400 |
oct | 173713071444 |
9 | 46826575504 |
10 | 16629134116 |
11 | 7063792651 |
12 | 3281091604 |
13 | 175021293a |
14 | b3a740100 |
15 | 674d6acb1 |
hex | 3df2c7324 |
16629134116 has 81 divisors (see below), whose sum is σ = 34645648401. Its totient is φ = 6963516000.
The previous prime is 16629134101. The next prime is 16629134143. The reversal of 16629134116 is 61143192661.
The square root of 16629134116 is 128954.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 540748516 + 16088385600 = 23254^2 + 126840^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 110126641 + ... + 110126791.
Almost surely, 216629134116 is an apocalyptic number.
16629134116 is the 128954-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16629134116
16629134116 is an abundant number, since it is smaller than the sum of its proper divisors (18016514285).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16629134116 is an equidigital number, since it uses as much as digits as its factorization.
16629134116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442 (or 221 counting only the distinct ones).
The product of its digits is 46656, while the sum is 40.
Multiplying 16629134116 by its product of digits (46656), we get a square (775848881316096 = 278540642).
The spelling of 16629134116 in words is "sixteen billion, six hundred twenty-nine million, one hundred thirty-four thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •