Base | Representation |
---|---|
bin | 1000110000011000101… |
… | …1001101111101100000 |
3 | 112101021112210200222002 |
4 | 2030012023031331200 |
5 | 4431033412200144 |
6 | 153034434303132 |
7 | 13603506210434 |
oct | 2140613157540 |
9 | 471245720862 |
10 | 150427459424 |
11 | 58883419800 |
12 | 251a1a27aa8 |
13 | 11253cb6528 |
14 | 73d04629c4 |
15 | 3da63b914e |
hex | 23062cdf60 |
150427459424 has 72 divisors (see below), whose sum is σ = 329645947680. Its totient is φ = 67510460160.
The previous prime is 150427459423. The next prime is 150427459439. The reversal of 150427459424 is 424954724051.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150427459423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 60002 + ... + 551774.
It is an arithmetic number, because the mean of its divisors is an integer number (4578415940).
Almost surely, 2150427459424 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 150427459424, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164822973840).
150427459424 is an abundant number, since it is smaller than the sum of its proper divisors (179218488256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150427459424 is a wasteful number, since it uses less digits than its factorization.
150427459424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 491884 (or 491865 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 47.
The spelling of 150427459424 in words is "one hundred fifty billion, four hundred twenty-seven million, four hundred fifty-nine thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •