Base | Representation |
---|---|
bin | 1001010100011110… |
… | …11101000011011100 |
3 | 110220201021100020111 |
4 | 10222033131003130 |
5 | 40221414132112 |
6 | 2144301455404 |
7 | 234665264332 |
oct | 45217350334 |
9 | 13821240214 |
10 | 5003661532 |
11 | 2138488a71 |
12 | b77871564 |
13 | 61984138c |
14 | 356775b52 |
15 | 1e442b5a7 |
hex | 12a3dd0dc |
5003661532 has 6 divisors (see below), whose sum is σ = 8756407688. Its totient is φ = 2501830764.
The previous prime is 5003661497. The next prime is 5003661539. The reversal of 5003661532 is 2351663005.
It is a junction number, because it is equal to n+sod(n) for n = 5003661494 and 5003661503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5003661539) 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 as a sum of consecutive naturals, namely, 625457688 + ... + 625457695.
Almost surely, 25003661532 is an apocalyptic number.
It is an amenable number.
5003661532 is a deficient number, since it is larger than the sum of its proper divisors (3752746156).
5003661532 is a wasteful number, since it uses less digits than its factorization.
5003661532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1250915387 (or 1250915385 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 31.
The square root of 5003661532 is about 70736.5643214314. The cubic root of 5003661532 is about 1710.3932536043.
The spelling of 5003661532 in words is "five billion, three million, six hundred sixty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •