Base | Representation |
---|---|
bin | 1010100111111111… |
… | …01100010111001000 |
3 | 112201112102000022200 |
4 | 11103333230113020 |
5 | 43140232014000 |
6 | 2342004120200 |
7 | 261232445661 |
oct | 52377542710 |
9 | 15645360280 |
10 | 5704173000 |
11 | 2467947669 |
12 | 1132396060 |
13 | 6cb9cc4c6 |
14 | 3c1804368 |
15 | 235ba0500 |
hex | 153fec5c8 |
5704173000 has 96 divisors (see below), whose sum is σ = 19280135160. Its totient is φ = 1521110400.
The previous prime is 5704172987. The next prime is 5704173017. The reversal of 5704173000 is 3714075.
It can be written as a sum of positive squares in 4 ways, for example, as 2387104164 + 3317068836 = 48858^2 + 57594^2 .
It is a super-2 number, since 2×57041730002 = 65075179227858000000, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 307899 + ... + 325898.
Almost surely, 25704173000 is an apocalyptic number.
5704173000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5704173000 is an abundant number, since it is smaller than the sum of its proper divisors (13575962160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5704173000 is a wasteful number, since it uses less digits than its factorization.
5704173000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 633824 (or 633807 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 27.
The square root of 5704173000 is about 75525.9756640058. The cubic root of 5704173000 is about 1786.7518051494.
Adding to 5704173000 its reverse (3714075), we get a palindrome (5707887075).
The spelling of 5704173000 in words is "five billion, seven hundred four million, one hundred seventy-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •