Base | Representation |
---|---|
bin | 111101100111… |
… | …000110111000 |
3 | 1010101112222000 |
4 | 331213012320 |
5 | 13113312333 |
6 | 1334101000 |
7 | 254165241 |
oct | 75470670 |
9 | 33345860 |
10 | 16150968 |
11 | 9131509 |
12 | 54aa760 |
13 | 34664b2 |
14 | 2205cc8 |
15 | 1640713 |
hex | f671b8 |
16150968 has 64 divisors (see below), whose sum is σ = 46828800. Its totient is φ = 5148000.
The previous prime is 16150961. The next prime is 16150973. The reversal of 16150968 is 86905161.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16150961) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3343 + ... + 6593.
It is an arithmetic number, because the mean of its divisors is an integer number (731700).
Almost surely, 216150968 is an apocalyptic number.
16150968 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16150968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23414400).
16150968 is an abundant number, since it is smaller than the sum of its proper divisors (30677832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16150968 is a wasteful number, since it uses less digits than its factorization.
16150968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3289 (or 3279 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 36.
The square root of 16150968 is about 4018.8266944470. The cubic root of 16150968 is about 252.7742626551.
The spelling of 16150968 in words is "sixteen million, one hundred fifty thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •