Base | Representation |
---|---|
bin | 111110100101011… |
… | …100101000100000 |
3 | 2201011202201201001 |
4 | 332211130220200 |
5 | 4122300112000 |
6 | 252105121344 |
7 | 35006613103 |
oct | 7645345040 |
9 | 2634681631 |
10 | 1050004000 |
11 | 499777601 |
12 | 253789254 |
13 | 1396c7356 |
14 | 9d64673a |
15 | 622ac46a |
hex | 3e95ca20 |
1050004000 has 48 divisors (see below), whose sum is σ = 2579869656. Its totient is φ = 420000000.
The previous prime is 1050003953. The next prime is 1050004001. The reversal of 1050004000 is 4000501.
It can be written as a sum of positive squares in 4 ways, for example, as 612859536 + 437144464 = 24756^2 + 20908^2 .
It is a super-2 number, since 2×10500040002 = 2205016800032000000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (1050004001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 127251 + ... + 135250.
Almost surely, 21050004000 is an apocalyptic number.
1050004000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1050004000 is an abundant number, since it is smaller than the sum of its proper divisors (1529865656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1050004000 is an equidigital number, since it uses as much as digits as its factorization.
1050004000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 262526 (or 262508 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 10.
The square root of 1050004000 is about 32403.7652133205. The cubic root of 1050004000 is about 1016.3976474753.
Adding to 1050004000 its reverse (4000501), we get a palindrome (1054004501).
The spelling of 1050004000 in words is "one billion, fifty million, four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •