Base | Representation |
---|---|
bin | 10010000101000… |
… | …00000000011010 |
3 | 101120100122010220 |
4 | 21002200000122 |
5 | 302310302310 |
6 | 23014220510 |
7 | 3521002146 |
oct | 1102400032 |
9 | 346318126 |
10 | 151650330 |
11 | 7866a157 |
12 | 42954736 |
13 | 25559130 |
14 | 161d8226 |
15 | d4a8670 |
hex | 90a001a |
151650330 has 64 divisors (see below), whose sum is σ = 393216768. Its totient is φ = 37209600.
The previous prime is 151650313. The next prime is 151650409. The reversal of 151650330 is 33056151.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 151650330.
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 31 ways as a sum of consecutive naturals, for example, 234067 + ... + 234713.
It is an arithmetic number, because the mean of its divisors is an integer number (6144012).
Almost surely, 2151650330 is an apocalyptic number.
151650330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 151650330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196608384).
151650330 is an abundant number, since it is smaller than the sum of its proper divisors (241566438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151650330 is a wasteful number, since it uses less digits than its factorization.
151650330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1271.
The product of its (nonzero) digits is 1350, while the sum is 24.
The square root of 151650330 is about 12314.6388497593. The cubic root of 151650330 is about 533.2707786876.
The spelling of 151650330 in words is "one hundred fifty-one million, six hundred fifty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •