Base | Representation |
---|---|
bin | 1000110000101010110… |
… | …1010010111100111001 |
3 | 112101110211220001020220 |
4 | 2030022231102330321 |
5 | 4431212344023000 |
6 | 153050152210253 |
7 | 13605421441011 |
oct | 2141255227471 |
9 | 471424801226 |
10 | 150503501625 |
11 | 589123373a4 |
12 | 25203399989 |
13 | 1126698c309 |
14 | 73da5b8c41 |
15 | 3dacdda1a0 |
hex | 230ab52f39 |
150503501625 has 32 divisors (see below), whose sum is σ = 251155632000. Its totient is φ = 80038468800.
The previous prime is 150503501609. The next prime is 150503501671. The reversal of 150503501625 is 526105305051.
150503501625 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 150503501625 - 24 = 150503501609 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 444115 + ... + 705864.
It is an arithmetic number, because the mean of its divisors is an integer number (7848613500).
Almost surely, 2150503501625 is an apocalyptic number.
150503501625 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
150503501625 is a deficient number, since it is larger than the sum of its proper divisors (100652130375).
150503501625 is a wasteful number, since it uses less digits than its factorization.
150503501625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1150346 (or 1150336 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 33.
Adding to 150503501625 its reverse (526105305051), we get a palindrome (676608806676).
The spelling of 150503501625 in words is "one hundred fifty billion, five hundred three million, five hundred one thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •