Base | Representation |
---|---|
bin | 10000110100111… |
… | …00100001111010 |
3 | 100211121011212000 |
4 | 20122130201322 |
5 | 242113302310 |
6 | 22001201430 |
7 | 3332520666 |
oct | 1032344172 |
9 | 324534760 |
10 | 141150330 |
11 | 72748372 |
12 | 3b330276 |
13 | 23320b09 |
14 | 14a638a6 |
15 | c5d24c0 |
hex | 869c87a |
141150330 has 64 divisors (see below), whose sum is σ = 379209600. Its totient is φ = 37359360.
The previous prime is 141150323. The next prime is 141150341. The reversal of 141150330 is 33051141.
It is a Harshad number since it is a multiple of its sum of digits (18).
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 31 ways as a sum of consecutive naturals, for example, 35650 + ... + 39410.
It is an arithmetic number, because the mean of its divisors is an integer number (5925150).
Almost surely, 2141150330 is an apocalyptic number.
141150330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 141150330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189604800).
141150330 is an abundant number, since it is smaller than the sum of its proper divisors (238059270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141150330 is a wasteful number, since it uses less digits than its factorization.
141150330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3916 (or 3910 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 141150330 is about 11880.6704356278. The cubic root of 141150330 is about 520.6676950546.
The spelling of 141150330 in words is "one hundred forty-one million, one hundred fifty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •