Base | Representation |
---|---|
bin | 10010000000100… |
… | …01000001001010 |
3 | 101112020212202001 |
4 | 21000101001022 |
5 | 302133032100 |
6 | 22553501214 |
7 | 3513012502 |
oct | 1100210112 |
9 | 345225661 |
10 | 151064650 |
11 | 782aa120 |
12 | 4271180a |
13 | 253b2689 |
14 | 160c4a02 |
15 | d3ded6a |
hex | 901104a |
151064650 has 48 divisors (see below), whose sum is σ = 307792800. Its totient is φ = 54705600.
The previous prime is 151064597. The next prime is 151064663. The reversal of 151064650 is 56460151.
151064650 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 23 ways as a sum of consecutive naturals, for example, 191557 + ... + 192343.
It is an arithmetic number, because the mean of its divisors is an integer number (6412350).
Almost surely, 2151064650 is an apocalyptic number.
151064650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
151064650 is an abundant number, since it is smaller than the sum of its proper divisors (156728150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151064650 is a wasteful number, since it uses less digits than its factorization.
151064650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1159 (or 1154 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 151064650 is about 12290.8360171308. The cubic root of 151064650 is about 532.5833882355.
The spelling of 151064650 in words is "one hundred fifty-one million, sixty-four thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •