Base | Representation |
---|---|
bin | 111011100110110… |
… | …1001011101100000 |
3 | 12011101110220022100 |
4 | 1313031221131200 |
5 | 13044004111100 |
6 | 530244210400 |
7 | 100364166243 |
oct | 16715513540 |
9 | 5141426270 |
10 | 2000066400 |
11 | 936a92542 |
12 | 479999a00 |
13 | 25b49b657 |
14 | 14d8b525a |
15 | ba8c7400 |
hex | 77369760 |
2000066400 has 108 divisors (see below), whose sum is σ = 7052759532. Its totient is φ = 533349120.
The previous prime is 2000066399. The next prime is 2000066417. The reversal of 2000066400 is 46600002.
2000066400 is a `hidden beast` number, since 2 + 0 + 0 + 0 + 0 + 664 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
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 17 ways as a sum of consecutive naturals, for example, 131694 + ... + 146093.
It is an arithmetic number, because the mean of its divisors is an integer number (65303329).
Almost surely, 22000066400 is an apocalyptic number.
2000066400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2000066400 is an abundant number, since it is smaller than the sum of its proper divisors (5052693132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000066400 is a wasteful number, since it uses less digits than its factorization.
2000066400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277813 (or 277797 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 2000066400 is about 44722.1019184027. The cubic root of 2000066400 is about 1259.9349928669.
Adding to 2000066400 its reverse (46600002), we get a palindrome (2046666402).
The spelling of 2000066400 in words is "two billion, sixty-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.417 sec. • engine limits •