Base | Representation |
---|---|
bin | 10001110001110… |
… | …11010010110100 |
3 | 101101122010112011 |
4 | 20320323102310 |
5 | 301140000120 |
6 | 22444334004 |
7 | 3460450264 |
oct | 1070732264 |
9 | 341563464 |
10 | 149140660 |
11 | 77205649 |
12 | 41b44304 |
13 | 24b8aa16 |
14 | 15b437a4 |
15 | d15ec5a |
hex | 8e3b4b4 |
149140660 has 48 divisors (see below), whose sum is σ = 336619584. Its totient is φ = 55300608.
The previous prime is 149140639. The next prime is 149140687. The reversal of 149140660 is 66041941.
149140660 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19507 + ... + 26053.
It is an arithmetic number, because the mean of its divisors is an integer number (7012908).
Almost surely, 2149140660 is an apocalyptic number.
149140660 is a gapful number since it is divisible by the number (10) 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 149140660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (168309792).
149140660 is an abundant number, since it is smaller than the sum of its proper divisors (187478924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149140660 is a wasteful number, since it uses less digits than its factorization.
149140660 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6640 (or 6638 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 31.
The square root of 149140660 is about 12212.3159146822. The cubic root of 149140660 is about 530.3126907635.
The spelling of 149140660 in words is "one hundred forty-nine million, one hundred forty thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •