Base | Representation |
---|---|
bin | 11111001110101011110… |
… | …000100111110100010100 |
3 | 21121011101022221110220011 |
4 | 133032223300213310110 |
5 | 240130123001040034 |
6 | 4321520251050004 |
7 | 311022423554242 |
oct | 37165360476424 |
9 | 7534338843804 |
10 | 2146070330644 |
11 | 758163832209 |
12 | 2a7b0a740904 |
13 | 1274b1948296 |
14 | 75c28397792 |
15 | 3ac56aca864 |
hex | 1f3abc27d14 |
2146070330644 has 12 divisors (see below), whose sum is σ = 3755714463424. Its totient is φ = 1073009055384.
The previous prime is 2146070330641. The next prime is 2146070330647. The reversal of 2146070330644 is 4460330706412.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2146070330641) and next prime (2146070330647).
It is a hoax number, since the sum of its digits (40) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 2146070330597 and 2146070330606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2146070330641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6341964 + ... + 6671779.
Almost surely, 22146070330644 is an apocalyptic number.
It is an amenable number.
2146070330644 is a deficient number, since it is larger than the sum of its proper divisors (1609644132780).
2146070330644 is a wasteful number, since it uses less digits than its factorization.
2146070330644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13054974 (or 13054972 counting only the distinct ones).
The product of its (nonzero) digits is 290304, while the sum is 40.
The spelling of 2146070330644 in words is "two trillion, one hundred forty-six billion, seventy million, three hundred thirty thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •