Base | Representation |
---|---|
bin | 1010101010000010… |
… | …00110100000111000 |
3 | 112202201200010212111 |
4 | 11111001012200320 |
5 | 43204124210410 |
6 | 2343415422104 |
7 | 261531261502 |
oct | 52501064070 |
9 | 15681603774 |
10 | 5721319480 |
11 | 2476599008 |
12 | 1138084934 |
13 | 702423b56 |
14 | 3c3bc8d72 |
15 | 23743ab8a |
hex | 155046838 |
5721319480 has 64 divisors (see below), whose sum is σ = 13078195200. Its totient is φ = 2252257920.
The previous prime is 5721319469. The next prime is 5721319481. The reversal of 5721319480 is 849131275.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5721319481) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 896541 + ... + 902899.
It is an arithmetic number, because the mean of its divisors is an integer number (204346800).
Almost surely, 25721319480 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 5721319480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6539097600).
5721319480 is an abundant number, since it is smaller than the sum of its proper divisors (7356875720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5721319480 is a wasteful number, since it uses less digits than its factorization.
5721319480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6724 (or 6720 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 40.
The square root of 5721319480 is about 75639.4042811021. The cubic root of 5721319480 is about 1788.5403120284.
The spelling of 5721319480 in words is "five billion, seven hundred twenty-one million, three hundred nineteen thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •