Base | Representation |
---|---|
bin | 1010011011101101… |
… | …00001110100110100 |
3 | 112110100110201200202 |
4 | 11031312201310310 |
5 | 42432340413002 |
6 | 2323443100032 |
7 | 255541424516 |
oct | 51566416464 |
9 | 15410421622 |
10 | 5601107252 |
11 | 2414751864 |
12 | 1103971618 |
13 | 6b3554460 |
14 | 3b1c55bb6 |
15 | 22bae2502 |
hex | 14dda1d34 |
5601107252 has 48 divisors (see below), whose sum is σ = 10865515584. Its totient is φ = 2509920000.
The previous prime is 5601107227. The next prime is 5601107329. The reversal of 5601107252 is 2527011065.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 443627 + ... + 456077.
It is an arithmetic number, because the mean of its divisors is an integer number (226364908).
Almost surely, 25601107252 is an apocalyptic number.
5601107252 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5601107252 is a deficient number, since it is larger than the sum of its proper divisors (5264408332).
5601107252 is a wasteful number, since it uses less digits than its factorization.
5601107252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12720 (or 12718 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 29.
The square root of 5601107252 is about 74840.5455084341. The cubic root of 5601107252 is about 1775.9250354724.
The spelling of 5601107252 in words is "five billion, six hundred one million, one hundred seven thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •