Base | Representation |
---|---|
bin | 10010000100111… |
… | …10001011111000 |
3 | 101120100020220200 |
4 | 21002132023320 |
5 | 302310032442 |
6 | 23014122200 |
7 | 3520641333 |
oct | 1102361370 |
9 | 346306820 |
10 | 151642872 |
11 | 78664597 |
12 | 42950360 |
13 | 25555914 |
14 | 161d561a |
15 | d4a634c |
hex | 909e2f8 |
151642872 has 48 divisors (see below), whose sum is σ = 421806840. Its totient is φ = 49180608.
The previous prime is 151642867. The next prime is 151642877. The reversal of 151642872 is 278246151.
151642872 is a `hidden beast` number, since 1 + 5 + 1 + 642 + 8 + 7 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (151642867) and next prime (151642877).
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 (151642877) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25798 + ... + 31125.
Almost surely, 2151642872 is an apocalyptic number.
151642872 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
151642872 is an abundant number, since it is smaller than the sum of its proper divisors (270163968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151642872 is a wasteful number, since it uses less digits than its factorization.
151642872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56972 (or 56965 counting only the distinct ones).
The product of its digits is 26880, while the sum is 36.
The square root of 151642872 is about 12314.3360356943. The cubic root of 151642872 is about 533.2620366499.
The spelling of 151642872 in words is "one hundred fifty-one million, six hundred forty-two thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •