Base | Representation |
---|---|
bin | 11110011101100101… |
… | …11100001001000000 |
3 | 1120012202121122222011 |
4 | 33032302330021000 |
5 | 231443204040140 |
6 | 11302454422304 |
7 | 1116163532311 |
oct | 171662741100 |
9 | 46182548864 |
10 | 16354361920 |
11 | 6a3267a196 |
12 | 3205061994 |
13 | 1708308940 |
14 | b12056608 |
15 | 65ab91cea |
hex | 3cecbc240 |
16354361920 has 112 divisors (see below), whose sum is σ = 42242719680. Its totient is φ = 5994878976.
The previous prime is 16354361887. The next prime is 16354361921. The reversal of 16354361920 is 2916345361.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is not an unprimeable number, because it can be changed into a prime (16354361921) 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, 564099 + ... + 592381.
It is an arithmetic number, because the mean of its divisors is an integer number (377167140).
Almost surely, 216354361920 is an apocalyptic number.
16354361920 is a gapful number since it is divisible by the number (10) 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 16354361920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21121359840).
16354361920 is an abundant number, since it is smaller than the sum of its proper divisors (25888357760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16354361920 is a wasteful number, since it uses less digits than its factorization.
16354361920 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28452 (or 28442 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 40.
The spelling of 16354361920 in words is "sixteen billion, three hundred fifty-four million, three hundred sixty-one thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •