Base | Representation |
---|---|
bin | 1001101110011011… |
… | …01101101001001000 |
3 | 111110212210222102211 |
4 | 10313031231221020 |
5 | 41143123342000 |
6 | 2222034434504 |
7 | 243250252135 |
oct | 46715555110 |
9 | 14425728384 |
10 | 5221309000 |
11 | 223a324806 |
12 | 1018732a34 |
13 | 65296706b |
14 | 37762d58c |
15 | 2085be7ba |
hex | 13736da48 |
5221309000 has 128 divisors (see below), whose sum is σ = 12586129920. Its totient is φ = 2026176000.
The previous prime is 5221308997. The next prime is 5221309109. The reversal of 5221309000 is 9031225.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14226817 + ... + 14227183.
It is an arithmetic number, because the mean of its divisors is an integer number (98329140).
Almost surely, 25221309000 is an apocalyptic number.
5221309000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5221309000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6293064960).
5221309000 is an abundant number, since it is smaller than the sum of its proper divisors (7364820920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5221309000 is a wasteful number, since it uses less digits than its factorization.
5221309000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 776 (or 762 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 5221309000 is about 72258.6257826704. The cubic root of 5221309000 is about 1734.8414840769.
The spelling of 5221309000 in words is "five billion, two hundred twenty-one million, three hundred nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •