Base | Representation |
---|---|
bin | 111011100111111… |
… | …0110011011100101 |
3 | 12011102120020101000 |
4 | 1313033312123211 |
5 | 13044131100223 |
6 | 530304423513 |
7 | 100402122540 |
oct | 16717663345 |
9 | 5142506330 |
10 | 2000643813 |
11 | 937347343 |
12 | 47a017b99 |
13 | 25b64140c |
14 | 14d9c5857 |
15 | ba98d543 |
hex | 773f66e5 |
2000643813 has 16 divisors (see below), whose sum is σ = 3387333760. Its totient is φ = 1143224928.
The previous prime is 2000643797. The next prime is 2000643829. The reversal of 2000643813 is 3183460002.
It is a happy number.
2000643813 is a `hidden beast` number, since 2 + 0 + 0 + 0 + 643 + 8 + 13 = 666.
It is an interprime number because it is at equal distance from previous prime (2000643797) and next prime (2000643829).
It is not a de Polignac number, because 2000643813 - 24 = 2000643797 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000643713) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5292520 + ... + 5292897.
It is an arithmetic number, because the mean of its divisors is an integer number (211708360).
Almost surely, 22000643813 is an apocalyptic number.
It is an amenable number.
2000643813 is a deficient number, since it is larger than the sum of its proper divisors (1386689947).
2000643813 is a wasteful number, since it uses less digits than its factorization.
2000643813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10585433 (or 10585427 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 2000643813 is about 44728.5570189784. The cubic root of 2000643813 is about 1260.0562276495.
The spelling of 2000643813 in words is "two billion, six hundred forty-three thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •