Base | Representation |
---|---|
bin | 10001111110110… |
… | …00001101100001 |
3 | 101111211001120020 |
4 | 20333120031201 |
5 | 302103110334 |
6 | 22544504053 |
7 | 3511023231 |
oct | 1077301541 |
9 | 344731506 |
10 | 150831969 |
11 | 78160322 |
12 | 4261b029 |
13 | 253307b2 |
14 | 16063cc1 |
15 | d395e49 |
hex | 8fd8361 |
150831969 has 8 divisors (see below), whose sum is σ = 201170112. Its totient is φ = 100524240.
The previous prime is 150831913. The next prime is 150831971. The reversal of 150831969 is 969138051.
150831969 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 150831969 - 28 = 150831713 is a prime.
It is a super-2 number, since 2×1508319692 = 45500565744833922, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 150831969.
It is not an unprimeable number, because it can be changed into a prime (150831979) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9412 + ... + 19754.
It is an arithmetic number, because the mean of its divisors is an integer number (25146264).
Almost surely, 2150831969 is an apocalyptic number.
It is an amenable number.
150831969 is a deficient number, since it is larger than the sum of its proper divisors (50338143).
150831969 is a wasteful number, since it uses less digits than its factorization.
150831969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15207.
The product of its (nonzero) digits is 58320, while the sum is 42.
The square root of 150831969 is about 12281.3667399032. The cubic root of 150831969 is about 532.3098062194.
The spelling of 150831969 in words is "one hundred fifty million, eight hundred thirty-one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •