Base | Representation |
---|---|
bin | 111011100110110… |
… | …0100011110110000 |
3 | 12011101102212022210 |
4 | 1313031210132300 |
5 | 13044002433000 |
6 | 530243532120 |
7 | 100364052621 |
oct | 16715443660 |
9 | 5141385283 |
10 | 2000046000 |
11 | 936a79187 |
12 | 47998a040 |
13 | 25b492294 |
14 | 14d8aba48 |
15 | ba8c1350 |
hex | 773647b0 |
2000046000 has 80 divisors (see below), whose sum is σ = 6448167648. Its totient is φ = 533344000.
The previous prime is 2000045981. The next prime is 2000046017. The reversal of 2000046000 is 6400002.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
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 15 ways as a sum of consecutive naturals, for example, 160671 + ... + 172670.
Almost surely, 22000046000 is an apocalyptic number.
2000046000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2000046000 is an abundant number, since it is smaller than the sum of its proper divisors (4448121648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000046000 is a wasteful number, since it uses less digits than its factorization.
2000046000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333367 (or 333351 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 2000046000 is about 44721.8738426735. The cubic root of 2000046000 is about 1259.9307092155.
Adding to 2000046000 its reverse (6400002), we get a palindrome (2006446002).
The spelling of 2000046000 in words is "two billion, forty-six thousand", and thus it is an eban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •