Base | Representation |
---|---|
bin | 11111001011110100110… |
… | …011000000110001110111 |
3 | 21120212110101221102211020 |
4 | 133023310303000301313 |
5 | 240102331141223042 |
6 | 4320251514512223 |
7 | 310553361424404 |
oct | 37136463006167 |
9 | 7525411842736 |
10 | 2143000726647 |
11 | 756929051300 |
12 | 2a73b2735673 |
13 | 127112a03561 |
14 | 75a168332ab |
15 | 3ab273883ec |
hex | 1f2f4cc0c77 |
2143000726647 has 24 divisors (see below), whose sum is σ = 3150195014400. Its totient is φ = 1294864414800.
The previous prime is 2143000726639. The next prime is 2143000726673. The reversal of 2143000726647 is 7466270003412.
It is not a de Polignac number, because 2143000726647 - 23 = 2143000726639 is a prime.
It is a super-2 number, since 2×21430007266472 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2143000726599 and 2143000726608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2143000726637) 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 23 ways as a sum of consecutive naturals, for example, 8797647 + ... + 9037952.
It is an arithmetic number, because the mean of its divisors is an integer number (131258125600).
Almost surely, 22143000726647 is an apocalyptic number.
2143000726647 is a deficient number, since it is larger than the sum of its proper divisors (1007194287753).
2143000726647 is a wasteful number, since it uses less digits than its factorization.
2143000726647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17835955 (or 17835944 counting only the distinct ones).
The product of its (nonzero) digits is 338688, while the sum is 42.
The spelling of 2143000726647 in words is "two trillion, one hundred forty-three billion, seven hundred twenty-six thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •