Base | Representation |
---|---|
bin | 1000110000010011011… |
… | …0011110100011011110 |
3 | 112101020000000002201012 |
4 | 2030010312132203132 |
5 | 4431012220321100 |
6 | 153032322215222 |
7 | 13603116326666 |
oct | 2140466364336 |
9 | 471200002635 |
10 | 150405245150 |
11 | 588719268a6 |
12 | 251964b4512 |
13 | 1124c5092a4 |
14 | 73cb51d1a6 |
15 | 3da447c135 |
hex | 2304d9e8de |
150405245150 has 24 divisors (see below), whose sum is σ = 279765941304. Its totient is φ = 60159477600.
The previous prime is 150405245149. The next prime is 150405245161. The reversal of 150405245150 is 51542504051.
150405245150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 1433480 + ... + 1534820.
It is an arithmetic number, because the mean of its divisors is an integer number (11656914221).
Almost surely, 2150405245150 is an apocalyptic number.
150405245150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
150405245150 is a deficient number, since it is larger than the sum of its proper divisors (129360696154).
150405245150 is a wasteful number, since it uses less digits than its factorization.
150405245150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131036 (or 131031 counting only the distinct ones).
The product of its (nonzero) digits is 20000, while the sum is 32.
The spelling of 150405245150 in words is "one hundred fifty billion, four hundred five million, two hundred forty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •