Base | Representation |
---|---|
bin | 11101111010111111… |
… | …00000110100111000 |
3 | 1112110112100121222110 |
4 | 32331133200310320 |
5 | 230344344303012 |
6 | 11214004252320 |
7 | 1106040141231 |
oct | 167537406470 |
9 | 45415317873 |
10 | 16064056632 |
11 | 68a3817568 |
12 | 31439a10a0 |
13 | 1690123770 |
14 | ac5688088 |
15 | 64044a73c |
hex | 3bd7e0d38 |
16064056632 has 32 divisors (see below), whose sum is σ = 43249384080. Its totient is φ = 4942786560.
The previous prime is 16064056621. The next prime is 16064056637. The reversal of 16064056632 is 23665046061.
It is a super-2 number, since 2×160640566322 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16064056637) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25743369 + ... + 25743992.
Almost surely, 216064056632 is an apocalyptic number.
16064056632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16064056632 is an abundant number, since it is smaller than the sum of its proper divisors (27185327448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16064056632 is a wasteful number, since it uses less digits than its factorization.
16064056632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51487383 (or 51487379 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 39.
The spelling of 16064056632 in words is "sixteen billion, sixty-four million, fifty-six thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •