Base | Representation |
---|---|
bin | 10001110111111… |
… | …10101100010000 |
3 | 101110010210101200 |
4 | 20323332230100 |
5 | 301341103013 |
6 | 22513431200 |
7 | 3500322540 |
oct | 1073765420 |
9 | 343123350 |
10 | 149941008 |
11 | 77701998 |
12 | 4226b500 |
13 | 250ab0b9 |
14 | 15cb1320 |
15 | d26be73 |
hex | 8efeb10 |
149941008 has 120 divisors (see below), whose sum is σ = 504878400. Its totient is φ = 40580352.
The previous prime is 149940971. The next prime is 149941009. The reversal of 149941008 is 800149941.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (149941009) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15238 + ... + 23066.
It is an arithmetic number, because the mean of its divisors is an integer number (4207320).
Almost surely, 2149941008 is an apocalyptic number.
149941008 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 149941008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (252439200).
149941008 is an abundant number, since it is smaller than the sum of its proper divisors (354937392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149941008 is a wasteful number, since it uses less digits than its factorization.
149941008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7869 (or 7860 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 36.
The square root of 149941008 is about 12245.0401387664. The cubic root of 149941008 is about 531.2596217312.
The spelling of 149941008 in words is "one hundred forty-nine million, nine hundred forty-one thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •