Base | Representation |
---|---|
bin | 1001010100011001… |
… | …11100111010111111 |
3 | 110220200001000111212 |
4 | 10222030330322333 |
5 | 40221232140011 |
6 | 2144235435035 |
7 | 234656563151 |
oct | 45214747277 |
9 | 13820030455 |
10 | 5003005631 |
11 | 21380801a8 |
12 | b775b5a7b |
13 | 619671980 |
14 | 356644ad1 |
15 | 1e434c08b |
hex | 12a33cebf |
5003005631 has 8 divisors (see below), whose sum is σ = 5424014400. Its totient is φ = 4587162912.
The previous prime is 5003005589. The next prime is 5003005643. The reversal of 5003005631 is 1365003005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5003005631 is a prime.
It is a super-2 number, since 2×50030056312 = 50060130687635416322, 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 = 5003005597 and 5003005606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5003005661) 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, 1289495 + ... + 1293368.
It is an arithmetic number, because the mean of its divisors is an integer number (678001800).
Almost surely, 25003005631 is an apocalyptic number.
5003005631 is a deficient number, since it is larger than the sum of its proper divisors (421008769).
5003005631 is a wasteful number, since it uses less digits than its factorization.
5003005631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2583025.
The product of its (nonzero) digits is 1350, while the sum is 23.
The square root of 5003005631 is about 70731.9279462959. The cubic root of 5003005631 is about 1710.3185151579.
Adding to 5003005631 its reverse (1365003005), we get a palindrome (6368008636).
The spelling of 5003005631 in words is "five billion, three million, five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •