Base | Representation |
---|---|
bin | 1010011101001111… |
… | …01110010000110100 |
3 | 112111020201220200101 |
4 | 11032213232100310 |
5 | 42444141101002 |
6 | 2325023323444 |
7 | 256056145264 |
oct | 51647562064 |
9 | 15436656611 |
10 | 5614003252 |
11 | 2420a5a810 |
12 | 1108150584 |
13 | 6b611b220 |
14 | 3b38517a4 |
15 | 22ccdd587 |
hex | 14e9ee434 |
5614003252 has 48 divisors (see below), whose sum is σ = 11568312000. Its totient is φ = 2350172160.
The previous prime is 5614003189. The next prime is 5614003259. The reversal of 5614003252 is 2523004165.
It is a self number, because there is not a number n which added to its sum of digits gives 5614003252.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5614003259) by changing a digit.
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, 245899 + ... + 267757.
It is an arithmetic number, because the mean of its divisors is an integer number (241006500).
Almost surely, 25614003252 is an apocalyptic number.
5614003252 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5614003252 is an abundant number, since it is smaller than the sum of its proper divisors (5954308748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5614003252 is a wasteful number, since it uses less digits than its factorization.
5614003252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22336 (or 22334 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 5614003252 is about 74926.6524809430. The cubic root of 5614003252 is about 1777.2869551719.
The spelling of 5614003252 in words is "five billion, six hundred fourteen million, three thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •