Base | Representation |
---|---|
bin | 1000101111111110000… |
… | …0000111101111011000 |
3 | 112100222202010111101120 |
4 | 2023333200013233120 |
5 | 4430321231422311 |
6 | 153015354445240 |
7 | 13600646440554 |
oct | 2137740075730 |
9 | 470882114346 |
10 | 150315498456 |
11 | 588261a8882 |
12 | 25170433820 |
13 | 11236a45736 |
14 | 73bd63a864 |
15 | 3d9b650706 |
hex | 22ff807bd8 |
150315498456 has 128 divisors (see below), whose sum is σ = 398655820800. Its totient is φ = 47098920960.
The previous prime is 150315498451. The next prime is 150315498497. The reversal of 150315498456 is 654894513051.
It is a junction number, because it is equal to n+sod(n) for n = 150315498399 and 150315498408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150315498451) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31756666 + ... + 31761398.
It is an arithmetic number, because the mean of its divisors is an integer number (3114498600).
Almost surely, 2150315498456 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 150315498456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (199327910400).
150315498456 is an abundant number, since it is smaller than the sum of its proper divisors (248340322344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150315498456 is a wasteful number, since it uses less digits than its factorization.
150315498456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5289 (or 5285 counting only the distinct ones).
The product of its (nonzero) digits is 2592000, while the sum is 51.
The spelling of 150315498456 in words is "one hundred fifty billion, three hundred fifteen million, four hundred ninety-eight thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •