Base | Representation |
---|---|
bin | 1001010100010100… |
… | …00000110101011111 |
3 | 110220121120212201112 |
4 | 10222022000311133 |
5 | 40221033011411 |
6 | 2144211132235 |
7 | 234650204120 |
oct | 45212006537 |
9 | 13817525645 |
10 | 5002235231 |
11 | 21376a4404 |
12 | b772a407b |
13 | 619462106 |
14 | 3564c4047 |
15 | 1e4248b8b |
hex | 12a280d5f |
5002235231 has 8 divisors (see below), whose sum is σ = 5723365920. Its totient is φ = 4282735968.
The previous prime is 5002235213. The next prime is 5002235257. The reversal of 5002235231 is 1325322005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5002235231 - 26 = 5002235167 is a prime.
It is a super-2 number, since 2×50022352312 = 50044714612515246722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5002235197 and 5002235206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5002235731) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 401276 + ... + 413553.
It is an arithmetic number, because the mean of its divisors is an integer number (715420740).
Almost surely, 25002235231 is an apocalyptic number.
5002235231 is a deficient number, since it is larger than the sum of its proper divisors (721130689).
5002235231 is an equidigital number, since it uses as much as digits as its factorization.
5002235231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 815713.
The product of its (nonzero) digits is 1800, while the sum is 23.
The square root of 5002235231 is about 70726.4818225818. The cubic root of 5002235231 is about 1710.2307214648.
Adding to 5002235231 its reverse (1325322005), we get a palindrome (6327557236).
The spelling of 5002235231 in words is "five billion, two million, two hundred thirty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •