Base | Representation |
---|---|
bin | 11110011000111101… |
… | …00000111001001000 |
3 | 1120010001101212222001 |
4 | 33030132200321020 |
5 | 231403223444000 |
6 | 11254544440344 |
7 | 1115212030240 |
oct | 171436407110 |
9 | 46101355861 |
10 | 16315453000 |
11 | 6a12714360 |
12 | 31b40190b4 |
13 | 1700234902 |
14 | b0ac08b20 |
15 | 65755846a |
hex | 3cc7a0e48 |
16315453000 has 128 divisors (see below), whose sum is σ = 47598969600. Its totient is φ = 5085312000.
The previous prime is 16315452991. The next prime is 16315453013. The reversal of 16315453000 is 35451361.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 16315453000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28945 + ... + 182944.
It is an arithmetic number, because the mean of its divisors is an integer number (371866950).
Almost surely, 216315453000 is an apocalyptic number.
16315453000 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 16315453000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23799484800).
16315453000 is an abundant number, since it is smaller than the sum of its proper divisors (31283516600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16315453000 is a wasteful number, since it uses less digits than its factorization.
16315453000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 211928 (or 211914 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
The spelling of 16315453000 in words is "sixteen billion, three hundred fifteen million, four hundred fifty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •