Base | Representation |
---|---|
bin | 1000101111111110000… |
… | …1101110101010111010 |
3 | 112100222202220220201110 |
4 | 2023333201232222322 |
5 | 4430321333420213 |
6 | 153015411501150 |
7 | 13600653144663 |
oct | 2137741565272 |
9 | 470882826643 |
10 | 150315920058 |
11 | 58826466607 |
12 | 251705b77b6 |
13 | 11236b625c5 |
14 | 73bd70a36a |
15 | 3d9b6d55c3 |
hex | 22ff86eaba |
150315920058 has 64 divisors (see below), whose sum is σ = 313135200000. Its totient is φ = 48063020544.
The previous prime is 150315920039. The next prime is 150315920059. The reversal of 150315920058 is 850029513051.
It is a junction number, because it is equal to n+sod(n) for n = 150315919998 and 150315920025.
It is not an unprimeable number, because it can be changed into a prime (150315920059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6884643 + ... + 6906441.
It is an arithmetic number, because the mean of its divisors is an integer number (4892737500).
Almost surely, 2150315920058 is an apocalyptic number.
150315920058 is an abundant number, since it is smaller than the sum of its proper divisors (162819279942).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150315920058 is a wasteful number, since it uses less digits than its factorization.
150315920058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22279.
The product of its (nonzero) digits is 54000, while the sum is 39.
The spelling of 150315920058 in words is "one hundred fifty billion, three hundred fifteen million, nine hundred twenty thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •