Base | Representation |
---|---|
bin | 1001100010011001… |
… | …11001011110011111 |
3 | 111012211222220020210 |
4 | 10301030321132133 |
5 | 40441312311111 |
6 | 2204032343503 |
7 | 240613645161 |
oct | 46114713637 |
9 | 14184886223 |
10 | 5120432031 |
11 | 2198394410 |
12 | baa9a4b93 |
13 | 637aa7350 |
14 | 368090931 |
15 | 1ee7e50a6 |
hex | 13133979f |
5120432031 has 32 divisors (see below), whose sum is σ = 8133834240. Its totient is φ = 2824214400.
The previous prime is 5120432021. The next prime is 5120432071. The reversal of 5120432031 is 1302340215.
It is not a de Polignac number, because 5120432031 - 210 = 5120431007 is a prime.
It is a super-2 number, since 2×51204320312 = 52437648368181569922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5120431989 and 5120432007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5120432021) 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, 53596 + ... + 114513.
It is an arithmetic number, because the mean of its divisors is an integer number (254182320).
Almost surely, 25120432031 is an apocalyptic number.
5120432031 is a deficient number, since it is larger than the sum of its proper divisors (3013402209).
5120432031 is a wasteful number, since it uses less digits than its factorization.
5120432031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168207.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 5120432031 is about 71557.1941247000. The cubic root of 5120432031 is about 1723.5962289211.
Adding to 5120432031 its reverse (1302340215), we get a palindrome (6422772246).
The spelling of 5120432031 in words is "five billion, one hundred twenty million, four hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •