Base | Representation |
---|---|
bin | 11101110101001001… |
… | …11101000000110000 |
3 | 1112100010022222021101 |
4 | 32322210331000300 |
5 | 230244334314102 |
6 | 11205100134144 |
7 | 1104604352530 |
oct | 167244750060 |
9 | 45303288241 |
10 | 16015151152 |
11 | 6879154110 |
12 | 312b537354 |
13 | 1682c5c600 |
14 | abcd974c0 |
15 | 63aed9e87 |
hex | 3ba93d030 |
16015151152 has 120 divisors (see below), whose sum is σ = 41891247360. Its totient is φ = 5759619840.
The previous prime is 16015151111. The next prime is 16015151213. The reversal of 16015151152 is 25115151061.
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 16015151152.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 169749 + ... + 246667.
It is an arithmetic number, because the mean of its divisors is an integer number (349093728).
Almost surely, 216015151152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16015151152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20945623680).
16015151152 is an abundant number, since it is smaller than the sum of its proper divisors (25876096208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16015151152 is a wasteful number, since it uses less digits than its factorization.
16015151152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76971 (or 76952 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 28.
Subtracting 16015151152 from its reverse (25115151061), we obtain a palindrome (9099999909).
The spelling of 16015151152 in words is "sixteen billion, fifteen million, one hundred fifty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •