Base | Representation |
---|---|
bin | 10001111101011… |
… | …11000011110101 |
3 | 101111111111100102 |
4 | 20332233003311 |
5 | 302032212123 |
6 | 22541123445 |
7 | 3506421635 |
oct | 1076570365 |
9 | 344444312 |
10 | 150663413 |
11 | 7805571a |
12 | 42559585 |
13 | 252a1b64 |
14 | 1601c6c5 |
15 | d361028 |
hex | 8faf0f5 |
150663413 has 4 divisors (see below), whose sum is σ = 150709068. Its totient is φ = 150617760.
The previous prime is 150663389. The next prime is 150663419. The reversal of 150663413 is 314366051.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 63091249 + 87572164 = 7943^2 + 9358^2 .
It is a cyclic number.
It is not a de Polignac number, because 150663413 - 216 = 150597877 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150663419) 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 3 ways as a sum of consecutive naturals, for example, 17456 + ... + 24617.
It is an arithmetic number, because the mean of its divisors is an integer number (37677267).
Almost surely, 2150663413 is an apocalyptic number.
It is an amenable number.
150663413 is a deficient number, since it is larger than the sum of its proper divisors (45655).
150663413 is an equidigital number, since it uses as much as digits as its factorization.
150663413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45654.
The product of its (nonzero) digits is 6480, while the sum is 29.
The square root of 150663413 is about 12274.5025561120. The cubic root of 150663413 is about 532.1114454088. Note that the first 3 decimals are identical.
The spelling of 150663413 in words is "one hundred fifty million, six hundred sixty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •