Base | Representation |
---|---|
bin | 10001111100000… |
… | …10001101011011 |
3 | 101111011011100111 |
4 | 20332002031123 |
5 | 302010322312 |
6 | 22533145151 |
7 | 3505025230 |
oct | 1076021533 |
9 | 344134314 |
10 | 150479707 |
11 | 77a3a6a4 |
12 | 4248b1b7 |
13 | 25239361 |
14 | 15db1787 |
15 | d3268a7 |
hex | 8f8235b |
150479707 has 4 divisors (see below), whose sum is σ = 171976816. Its totient is φ = 128982600.
The previous prime is 150479701. The next prime is 150479711. The reversal of 150479707 is 707974051.
150479707 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 707974051 = 277 ⋅2555863.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150479707 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 150479707.
It is not an unprimeable number, because it can be changed into a prime (150479701) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10748544 + ... + 10748557.
It is an arithmetic number, because the mean of its divisors is an integer number (42994204).
Almost surely, 2150479707 is an apocalyptic number.
150479707 is a deficient number, since it is larger than the sum of its proper divisors (21497109).
150479707 is an equidigital number, since it uses as much as digits as its factorization.
150479707 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21497108.
The product of its (nonzero) digits is 61740, while the sum is 40.
The square root of 150479707 is about 12267.0170375687. The cubic root of 150479707 is about 531.8950871474.
The spelling of 150479707 in words is "one hundred fifty million, four hundred seventy-nine thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •