Base | Representation |
---|---|
bin | 10010000000010… |
… | …11010000100000 |
3 | 101112012200101012 |
4 | 21000023100200 |
5 | 302131303211 |
6 | 22553200052 |
7 | 3512553635 |
oct | 1100132040 |
9 | 345180335 |
10 | 151041056 |
11 | 78293421 |
12 | 42700028 |
13 | 253a4a0a |
14 | 160ba18c |
15 | d3d7d8b |
hex | 900b420 |
151041056 has 48 divisors (see below), whose sum is σ = 318087000. Its totient is φ = 70348800.
The previous prime is 151041047. The next prime is 151041091. The reversal of 151041056 is 650140151.
It can be written as a sum of positive squares in 4 ways, for example, as 146797456 + 4243600 = 12116^2 + 2060^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53570 + ... + 56318.
Almost surely, 2151041056 is an apocalyptic number.
151041056 is a gapful number since it is divisible by the number (16) 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 151041056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159043500).
151041056 is an abundant number, since it is smaller than the sum of its proper divisors (167045944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151041056 is a wasteful number, since it uses less digits than its factorization.
151041056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2877 (or 2869 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 23.
The square root of 151041056 is about 12289.8761588553. The cubic root of 151041056 is about 532.5556596510. Note that the first 3 decimals are identical.
The spelling of 151041056 in words is "one hundred fifty-one million, forty-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •