Base | Representation |
---|---|
bin | 101010100111110… |
… | …101000101100000 |
3 | 1211211120001000100 |
4 | 222213311011200 |
5 | 2431030143003 |
6 | 154542422400 |
7 | 23502054243 |
oct | 5247650540 |
9 | 1754501010 |
10 | 715084128 |
11 | 337712320 |
12 | 17b591a00 |
13 | b51c1105 |
14 | 6ad8325a |
15 | 42ba1ba3 |
hex | 2a9f5160 |
715084128 has 72 divisors (see below), whose sum is σ = 2218395816. Its totient is φ = 216691200.
The previous prime is 715084127. The next prime is 715084159. The reversal of 715084128 is 821480517.
It is a tau number, because it is divible by the number of its divisors (72).
It is a super-2 number, since 2×7150841282 = 1022690620235040768, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 715084092 and 715084101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (715084127) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 109693 + ... + 116028.
It is an arithmetic number, because the mean of its divisors is an integer number (30811053).
Almost surely, 2715084128 is an apocalyptic number.
It is an amenable number.
715084128 is an abundant number, since it is smaller than the sum of its proper divisors (1503311688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
715084128 is a wasteful number, since it uses less digits than its factorization.
715084128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 225748 (or 225737 counting only the distinct ones).
The product of its (nonzero) digits is 17920, while the sum is 36.
The square root of 715084128 is about 26741.0569723786. The cubic root of 715084128 is about 894.2364733363.
The spelling of 715084128 in words is "seven hundred fifteen million, eighty-four thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •