Base | Representation |
---|---|
bin | 10001111100001… |
… | …11101011010100 |
3 | 101111012022001212 |
4 | 20332013223110 |
5 | 302012031400 |
6 | 22533440552 |
7 | 3505150430 |
oct | 1076075324 |
9 | 344168055 |
10 | 150502100 |
11 | 77a55501 |
12 | 424a0158 |
13 | 252465c8 |
14 | 15db99c0 |
15 | d32d335 |
hex | 8f87ad4 |
150502100 has 72 divisors (see below), whose sum is σ = 378934080. Its totient is φ = 50814720.
The previous prime is 150502081. The next prime is 150502109. The reversal of 150502100 is 1205051.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150502109) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 45296 + ... + 48504.
Almost surely, 2150502100 is an apocalyptic number.
150502100 is a gapful number since it is divisible by the number (10) 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 150502100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189467040).
150502100 is an abundant number, since it is smaller than the sum of its proper divisors (228431980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150502100 is a wasteful number, since it uses less digits than its factorization.
150502100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3297 (or 3290 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 14.
The square root of 150502100 is about 12267.9297356971. The cubic root of 150502100 is about 531.9214697434.
Adding to 150502100 its reverse (1205051), we get a palindrome (151707151).
The spelling of 150502100 in words is "one hundred fifty million, five hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •