Base | Representation |
---|---|
bin | 10010000001001… |
… | …01111010101000 |
3 | 101112102020011100 |
4 | 21000211322220 |
5 | 302143301443 |
6 | 22555401400 |
7 | 3513520164 |
oct | 1100457250 |
9 | 345366140 |
10 | 151150248 |
11 | 78358467 |
12 | 42753260 |
13 | 25412622 |
14 | 16107ca4 |
15 | d40a3d3 |
hex | 9025ea8 |
151150248 has 24 divisors (see below), whose sum is σ = 409365450. Its totient is φ = 50383392.
The previous prime is 151150243. The next prime is 151150249. The reversal of 151150248 is 842051151.
151150248 is a `hidden beast` number, since 151 + 1 + 502 + 4 + 8 = 666.
It can be written as a sum of positive squares in only one way, i.e., 145009764 + 6140484 = 12042^2 + 2478^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is not an unprimeable number, because it can be changed into a prime (151150243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1049583 + ... + 1049726.
Almost surely, 2151150248 is an apocalyptic number.
151150248 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
151150248 is an abundant number, since it is smaller than the sum of its proper divisors (258215202).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151150248 is a wasteful number, since it uses less digits than its factorization.
151150248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2099321 (or 2099314 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 27.
The square root of 151150248 is about 12294.3177118537. The cubic root of 151150248 is about 532.6839620958.
The spelling of 151150248 in words is "one hundred fifty-one million, one hundred fifty thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •