Base | Representation |
---|---|
bin | 10001100000111… |
… | …10110111000010 |
3 | 101020110200000022 |
4 | 20300132313002 |
5 | 300103131132 |
6 | 22325053442 |
7 | 3432600503 |
oct | 1060366702 |
9 | 336420008 |
10 | 146927042 |
11 | 75a33509 |
12 | 41257282 |
13 | 245942a2 |
14 | 15728baa |
15 | cd73e12 |
hex | 8c1edc2 |
146927042 has 8 divisors (see below), whose sum is σ = 227500032. Its totient is φ = 71093700.
The previous prime is 146927041. The next prime is 146927069. The reversal of 146927042 is 240729641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 146926993 and 146927011.
It is not an unprimeable number, because it can be changed into a prime (146927041) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1184834 + ... + 1184957.
It is an arithmetic number, because the mean of its divisors is an integer number (28437504).
Almost surely, 2146927042 is an apocalyptic number.
146927042 is a deficient number, since it is larger than the sum of its proper divisors (80572990).
146927042 is a wasteful number, since it uses less digits than its factorization.
146927042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2369824.
The product of its (nonzero) digits is 24192, while the sum is 35.
The square root of 146927042 is about 12121.3465423607. The cubic root of 146927042 is about 527.6758824411.
The spelling of 146927042 in words is "one hundred forty-six million, nine hundred twenty-seven thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •