Base | Representation |
---|---|
bin | 1001010111110100… |
… | …11010100001010011 |
3 | 110222200000212120010 |
4 | 10223322122201103 |
5 | 40301103404223 |
6 | 2151142450003 |
7 | 235455514641 |
oct | 45372324123 |
9 | 13880025503 |
10 | 5031700563 |
11 | 215229a11a |
12 | b85133903 |
13 | 6225aa916 |
14 | 35a394191 |
15 | 1e6b19393 |
hex | 12be9a853 |
5031700563 has 8 divisors (see below), whose sum is σ = 6709389568. Its totient is φ = 3354239304.
The previous prime is 5031700549. The next prime is 5031700589. The reversal of 5031700563 is 3650071305.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5031700563 - 222 = 5027506259 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5031700563.
It is not an unprimeable number, because it can be changed into a prime (5031700543) 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 in 7 ways as a sum of consecutive naturals, for example, 3906 + ... + 100392.
It is an arithmetic number, because the mean of its divisors is an integer number (838673696).
Almost surely, 25031700563 is an apocalyptic number.
5031700563 is a deficient number, since it is larger than the sum of its proper divisors (1677689005).
5031700563 is a wasteful number, since it uses less digits than its factorization.
5031700563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113873.
The product of its (nonzero) digits is 9450, while the sum is 30.
The square root of 5031700563 is about 70934.4807762769. The cubic root of 5031700563 is about 1713.5821494849.
Adding to 5031700563 its reverse (3650071305), we get a palindrome (8681771868).
The spelling of 5031700563 in words is "five billion, thirty-one million, seven hundred thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •