Base | Representation |
---|---|
bin | 1000101111101100101… |
… | …0010001010000111011 |
3 | 112100210200001222210010 |
4 | 2023323022101100323 |
5 | 4430144110131220 |
6 | 153004233353003 |
7 | 13566103356666 |
oct | 2137312212073 |
9 | 470720058703 |
10 | 150242661435 |
11 | 5879907a299 |
12 | 2514bb68763 |
13 | 112249227c9 |
14 | 73b3aba6dd |
15 | 3d950641e0 |
hex | 22fb29143b |
150242661435 has 16 divisors (see below), whose sum is σ = 240399899424. Its totient is φ = 80125539072.
The previous prime is 150242661431. The next prime is 150242661473. The reversal of 150242661435 is 534166242051.
150242661435 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 150242661435 - 22 = 150242661431 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 150242661393 and 150242661402.
It is not an unprimeable number, because it can be changed into a prime (150242661431) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 92479 + ... + 555911.
It is an arithmetic number, because the mean of its divisors is an integer number (15024993714).
Almost surely, 2150242661435 is an apocalyptic number.
150242661435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
150242661435 is a deficient number, since it is larger than the sum of its proper divisors (90157237989).
150242661435 is a wasteful number, since it uses less digits than its factorization.
150242661435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485054.
The product of its (nonzero) digits is 172800, while the sum is 39.
The spelling of 150242661435 in words is "one hundred fifty billion, two hundred forty-two million, six hundred sixty-one thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •