Base | Representation |
---|---|
bin | 101010100010100… |
… | …000100010100000 |
3 | 1211201221011121010 |
4 | 222202200202200 |
5 | 2430201023443 |
6 | 154452500520 |
7 | 23454154446 |
oct | 5242404240 |
9 | 1751834533 |
10 | 713689248 |
11 | 33694a328 |
12 | 17b01a740 |
13 | b4b2323c |
14 | 6aadcb96 |
15 | 429c8733 |
hex | 2a8a08a0 |
713689248 has 96 divisors (see below), whose sum is σ = 1979208000. Its totient is φ = 224557056.
The previous prime is 713689181. The next prime is 713689253. The reversal of 713689248 is 842986317.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 713689197 and 713689206.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 679828 + ... + 680876.
It is an arithmetic number, because the mean of its divisors is an integer number (20616750).
Almost surely, 2713689248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 713689248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (989604000).
713689248 is an abundant number, since it is smaller than the sum of its proper divisors (1265518752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
713689248 is a wasteful number, since it uses less digits than its factorization.
713689248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1454 (or 1446 counting only the distinct ones).
The product of its digits is 580608, while the sum is 48.
The square root of 713689248 is about 26714.9629982899. The cubic root of 713689248 is about 893.6546469221.
The spelling of 713689248 in words is "seven hundred thirteen million, six hundred eighty-nine thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •