Base | Representation |
---|---|
bin | 10001011010010… |
… | …00011110101100 |
3 | 101011211001111000 |
4 | 20231020132230 |
5 | 244342031230 |
6 | 22254200300 |
7 | 3422252442 |
oct | 1055103654 |
9 | 334731430 |
10 | 146048940 |
11 | 75493804 |
12 | 40ab3090 |
13 | 243476bb |
14 | 1557ab92 |
15 | cc4db60 |
hex | 8b487ac |
146048940 has 48 divisors (see below), whose sum is σ = 454376160. Its totient is φ = 38946240.
The previous prime is 146048933. The next prime is 146048957. The reversal of 146048940 is 49840641.
It is a happy number.
146048940 is a `hidden beast` number, since 1 + 4 + 604 + 8 + 9 + 40 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 146048895 and 146048904.
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 15 ways as a sum of consecutive naturals, for example, 134691 + ... + 135770.
It is an arithmetic number, because the mean of its divisors is an integer number (9466170).
Almost surely, 2146048940 is an apocalyptic number.
146048940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
146048940 is an abundant number, since it is smaller than the sum of its proper divisors (308327220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146048940 is a wasteful number, since it uses less digits than its factorization.
146048940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270479 (or 270471 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The square root of 146048940 is about 12085.0709555219. The cubic root of 146048940 is about 526.6225719283.
The spelling of 146048940 in words is "one hundred forty-six million, forty-eight thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •