Base | Representation |
---|---|
bin | 101100101111101… |
… | …1111000110001000 |
3 | 10212122012100100110 |
4 | 1121133133012020 |
5 | 11033331113211 |
6 | 404552434320 |
7 | 52130624304 |
oct | 13137370610 |
9 | 3778170313 |
10 | 1501426056 |
11 | 700574689 |
12 | 35a9a89a0 |
13 | 1ac0a13b0 |
14 | 103594d04 |
15 | 8bc2bea6 |
hex | 597df188 |
1501426056 has 128 divisors (see below), whose sum is σ = 4298112000. Its totient is φ = 433237248.
The previous prime is 1501426051. The next prime is 1501426057. The reversal of 1501426056 is 6506241051.
It is not an unprimeable number, because it can be changed into a prime (1501426051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 609355 + ... + 611813.
It is an arithmetic number, because the mean of its divisors is an integer number (33579000).
Almost surely, 21501426056 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 1501426056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2149056000).
1501426056 is an abundant number, since it is smaller than the sum of its proper divisors (2796685944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1501426056 is a wasteful number, since it uses less digits than its factorization.
1501426056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2603 (or 2599 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
The square root of 1501426056 is about 38748.2393922614. The cubic root of 1501426056 is about 1145.0768891242.
The spelling of 1501426056 in words is "one billion, five hundred one million, four hundred twenty-six thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •