Base | Representation |
---|---|
bin | 1001110010001001… |
… | …01110000011101000 |
3 | 111120001111221110001 |
4 | 10321010232003220 |
5 | 41224120141312 |
6 | 2225111232344 |
7 | 244106364040 |
oct | 47104560350 |
9 | 14501457401 |
10 | 5252505832 |
11 | 22559a2412 |
12 | 10270786b4 |
13 | 65926aa22 |
14 | 37b830720 |
15 | 20b1d3057 |
hex | 13912e0e8 |
5252505832 has 64 divisors (see below), whose sum is σ = 11684044800. Its totient is φ = 2166160320.
The previous prime is 5252505779. The next prime is 5252505847. The reversal of 5252505832 is 2385052525.
It is an alternating number because its digits alternate between odd and even.
It is a junction number, because it is equal to n+sod(n) for n = 5252505791 and 5252505800.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 302293 + ... + 319195.
It is an arithmetic number, because the mean of its divisors is an integer number (182563200).
Almost surely, 25252505832 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 5252505832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5842022400).
5252505832 is an abundant number, since it is smaller than the sum of its proper divisors (6431538968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5252505832 is a wasteful number, since it uses less digits than its factorization.
5252505832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17126 (or 17122 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 37.
The square root of 5252505832 is about 72474.1735516867. The cubic root of 5252505832 is about 1738.2897971527.
The spelling of 5252505832 in words is "five billion, two hundred fifty-two million, five hundred five thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •