Base | Representation |
---|---|
bin | 1000100011011110110… |
… | …0101100001000010101 |
3 | 112001100010110201020102 |
4 | 2020313230230020111 |
5 | 4401440104200122 |
6 | 151303010343445 |
7 | 13421613602240 |
oct | 2106754541025 |
9 | 461303421212 |
10 | 146963350037 |
11 | 57365a86089 |
12 | 2459588ab85 |
13 | 10b2140516a |
14 | 7182368257 |
15 | 3c521eb492 |
hex | 2237b2c215 |
146963350037 has 16 divisors (see below), whose sum is σ = 173641792512. Its totient is φ = 121718280960.
The previous prime is 146963350007. The next prime is 146963350043. The reversal of 146963350037 is 730053369641.
It is a de Polignac number, because none of the positive numbers 2k-146963350037 is a prime.
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146963349973 and 146963350000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146963350007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 376868 + ... + 660269.
It is an arithmetic number, because the mean of its divisors is an integer number (10852612032).
Almost surely, 2146963350037 is an apocalyptic number.
It is an amenable number.
146963350037 is a deficient number, since it is larger than the sum of its proper divisors (26678442475).
146963350037 is a wasteful number, since it uses less digits than its factorization.
146963350037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1037828.
The product of its (nonzero) digits is 1224720, while the sum is 47.
The spelling of 146963350037 in words is "one hundred forty-six billion, nine hundred sixty-three million, three hundred fifty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •