Base | Representation |
---|---|
bin | 1001010110111001… |
… | …01011111100101001 |
3 | 110222010100221122210 |
4 | 10223130223330221 |
5 | 40242110021000 |
6 | 2150303435333 |
7 | 235332340002 |
oct | 45334537451 |
9 | 13863327583 |
10 | 5023907625 |
11 | 2148957180 |
12 | b825b5b49 |
13 | 620aac809 |
14 | 3593261a9 |
15 | 1e60ca350 |
hex | 12b72bf29 |
5023907625 has 32 divisors (see below), whose sum is σ = 9119769984. Its totient is φ = 2435832000.
The previous prime is 5023907621. The next prime is 5023907729. The reversal of 5023907625 is 5267093205.
It is not a de Polignac number, because 5023907625 - 22 = 5023907621 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5023907621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 604834 + ... + 613083.
It is an arithmetic number, because the mean of its divisors is an integer number (284992812).
Almost surely, 25023907625 is an apocalyptic number.
5023907625 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5023907625 is a deficient number, since it is larger than the sum of its proper divisors (4095862359).
5023907625 is a wasteful number, since it uses less digits than its factorization.
5023907625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1217946 (or 1217936 counting only the distinct ones).
The product of its (nonzero) digits is 113400, while the sum is 39.
The square root of 5023907625 is about 70879.5289558276. The cubic root of 5023907625 is about 1712.6970451867.
It can be divided in two parts, 502390 and 7625, that added together give a palindrome (510015).
The spelling of 5023907625 in words is "five billion, twenty-three million, nine hundred seven thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •