Base | Representation |
---|---|
bin | 111101011010… |
… | …001010100000 |
3 | 1010021212020110 |
4 | 331122022200 |
5 | 13110113302 |
6 | 1333011320 |
7 | 253554543 |
oct | 75321240 |
9 | 33255213 |
10 | 16097952 |
11 | 90a56a2 |
12 | 5483b40 |
13 | 3448320 |
14 | 21d085a |
15 | 162eb6c |
hex | f5a2a0 |
16097952 has 48 divisors (see below), whose sum is σ = 45511200. Its totient is φ = 4952832.
The previous prime is 16097951. The next prime is 16097969. The reversal of 16097952 is 25979061.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 16097952.
It is not an unprimeable number, because it can be changed into a prime (16097951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5202 + ... + 7697.
It is an arithmetic number, because the mean of its divisors is an integer number (948150).
Almost surely, 216097952 is an apocalyptic number.
16097952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16097952 is an abundant number, since it is smaller than the sum of its proper divisors (29413248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16097952 is a wasteful number, since it uses less digits than its factorization.
16097952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12925 (or 12917 counting only the distinct ones).
The product of its (nonzero) digits is 34020, while the sum is 39.
The square root of 16097952 is about 4012.2253177009. The cubic root of 16097952 is about 252.4973799682.
The spelling of 16097952 in words is "sixteen million, ninety-seven thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •