Base | Representation |
---|---|
bin | 10010000011111… |
… | …10011011000000 |
3 | 101120002122110000 |
4 | 21001332123000 |
5 | 302241402033 |
6 | 23011240000 |
7 | 3516560121 |
oct | 1101763300 |
9 | 346078400 |
10 | 151512768 |
11 | 78585870 |
12 | 428a9000 |
13 | 2550b634 |
14 | 161a0048 |
15 | d47ca13 |
hex | 907e6c0 |
151512768 has 140 divisors (see below), whose sum is σ = 490145832. Its totient is φ = 45895680.
The previous prime is 151512763. The next prime is 151512787. The reversal of 151512768 is 867215151.
It is a super-2 number, since 2×1515127682 = 45912237734043648, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (151512763) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 55696 + ... + 58352.
Almost surely, 2151512768 is an apocalyptic number.
151512768 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 151512768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (245072916).
151512768 is an abundant number, since it is smaller than the sum of its proper divisors (338633064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151512768 is a wasteful number, since it uses less digits than its factorization.
151512768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2692 (or 2673 counting only the distinct ones).
The product of its digits is 16800, while the sum is 36.
The square root of 151512768 is about 12309.0522787094. The cubic root of 151512768 is about 533.1094866174.
The spelling of 151512768 in words is "one hundred fifty-one million, five hundred twelve thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •