Base | Representation |
---|---|
bin | 10001111101101… |
… | …10011000100000 |
3 | 101111120000111100 |
4 | 20332312120200 |
5 | 302034142113 |
6 | 22541514400 |
7 | 3506605245 |
oct | 1076663040 |
9 | 344500440 |
10 | 150693408 |
11 | 78076208 |
12 | 42572a00 |
13 | 252b26c8 |
14 | 160295cc |
15 | d369d73 |
hex | 8fb6620 |
150693408 has 72 divisors (see below), whose sum is σ = 451105200. Its totient is φ = 47585664.
The previous prime is 150693397. The next prime is 150693419. The reversal of 150693408 is 804396051.
It is an interprime number because it is at equal distance from previous prime (150693397) and next prime (150693419).
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8298 + ... + 19241.
It is an arithmetic number, because the mean of its divisors is an integer number (6265350).
Almost surely, 2150693408 is an apocalyptic number.
150693408 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
150693408 is an abundant number, since it is smaller than the sum of its proper divisors (300411792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150693408 is a wasteful number, since it uses less digits than its factorization.
150693408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27574 (or 27563 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 150693408 is about 12275.7243370809. The cubic root of 150693408 is about 532.1467550734.
The spelling of 150693408 in words is "one hundred fifty million, six hundred ninety-three thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •