Base | Representation |
---|---|
bin | 10001011101000… |
… | …11001110011101 |
3 | 101012111221100120 |
4 | 20232203032131 |
5 | 244440430022 |
6 | 22310145153 |
7 | 3425361216 |
oct | 1056431635 |
9 | 335457316 |
10 | 146420637 |
11 | 75717aa0 |
12 | 410521b9 |
13 | 2444793c |
14 | 1563640d |
15 | ccc3d5c |
hex | 8ba339d |
146420637 has 8 divisors (see below), whose sum is σ = 212975520. Its totient is φ = 88739760.
The previous prime is 146420621. The next prime is 146420639. The reversal of 146420637 is 736024641.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 146420637 - 24 = 146420621 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 4436989 = 146420637 / (1 + 4 + 6 + 4 + 2 + 0 + 6 + 3 + 7).
It is a junction number, because it is equal to n+sod(n) for n = 146420598 and 146420607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146420639) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2218462 + ... + 2218527.
It is an arithmetic number, because the mean of its divisors is an integer number (26621940).
Almost surely, 2146420637 is an apocalyptic number.
It is an amenable number.
146420637 is a deficient number, since it is larger than the sum of its proper divisors (66554883).
146420637 is a wasteful number, since it uses less digits than its factorization.
146420637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4437003.
The product of its (nonzero) digits is 24192, while the sum is 33.
The square root of 146420637 is about 12100.4395374714. The cubic root of 146420637 is about 527.0689478879.
The spelling of 146420637 in words is "one hundred forty-six million, four hundred twenty thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •