Base | Representation |
---|---|
bin | 1010100000001001… |
… | …10011001000001100 |
3 | 112112221122112020220 |
4 | 11100010303020030 |
5 | 43021412340242 |
6 | 2331254311340 |
7 | 256503426315 |
oct | 52004631014 |
9 | 15487575226 |
10 | 5638402572 |
11 | 2433805340 |
12 | 1114358550 |
13 | 6bb1b1baa |
14 | 3b6ba360c |
15 | 23000cbec |
hex | 15013320c |
5638402572 has 96 divisors (see below), whose sum is σ = 14513990400. Its totient is φ = 1689473280.
The previous prime is 5638402507. The next prime is 5638402573. The reversal of 5638402572 is 2752048365.
It is not an unprimeable number, because it can be changed into a prime (5638402573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5565538 + ... + 5566550.
It is an arithmetic number, because the mean of its divisors is an integer number (151187400).
Almost surely, 25638402572 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 5638402572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7256995200).
5638402572 is an abundant number, since it is smaller than the sum of its proper divisors (8875587828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5638402572 is a wasteful number, since it uses less digits than its factorization.
5638402572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1463 (or 1461 counting only the distinct ones).
The product of its (nonzero) digits is 403200, while the sum is 42.
The square root of 5638402572 is about 75089.2973199244. The cubic root of 5638402572 is about 1779.8580213314.
The spelling of 5638402572 in words is "five billion, six hundred thirty-eight million, four hundred two thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •