Base | Representation |
---|---|
bin | 11110100010100100… |
… | …10011110100111000 |
3 | 1120022200020012111020 |
4 | 33101102103310320 |
5 | 232034402433312 |
6 | 11310550102440 |
7 | 1120211613642 |
oct | 172122236470 |
9 | 46280205436 |
10 | 16396139832 |
11 | 6a54214596 |
12 | 321704aa20 |
13 | 1713b757b7 |
14 | b1780d892 |
15 | 65e69578c |
hex | 3d1493d38 |
16396139832 has 32 divisors (see below), whose sum is σ = 43147737600. Its totient is φ = 5177728224.
The previous prime is 16396139807. The next prime is 16396139839. The reversal of 16396139832 is 23893169361.
It is a happy number.
16396139832 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16396139839) 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 7 ways as a sum of consecutive naturals, for example, 17977768 + ... + 17978679.
It is an arithmetic number, because the mean of its divisors is an integer number (1348366800).
Almost surely, 216396139832 is an apocalyptic number.
16396139832 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16396139832 is an abundant number, since it is smaller than the sum of its proper divisors (26751597768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16396139832 is a wasteful number, since it uses less digits than its factorization.
16396139832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35956475 (or 35956471 counting only the distinct ones).
The product of its digits is 1259712, while the sum is 51.
The spelling of 16396139832 in words is "sixteen billion, three hundred ninety-six million, one hundred thirty-nine thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •