Base | Representation |
---|---|
bin | 100100100110110010100… |
… | …0101111001111001101001 |
3 | 122210222011012102112211111 |
4 | 1021031211011321321221 |
5 | 1124412144301002223 |
6 | 14411131240230321 |
7 | 1026325262530363 |
oct | 111154505717151 |
9 | 18728135375744 |
10 | 5031102750313 |
11 | 166a751384192 |
12 | 69308a16b3a1 |
13 | 2a657aa60b33 |
14 | 135714447d33 |
15 | 8ad0d07630d |
hex | 49365179e69 |
5031102750313 has 4 divisors (see below), whose sum is σ = 5035291846228. Its totient is φ = 5026913654400.
The previous prime is 5031102750283. The next prime is 5031102750341. The reversal of 5031102750313 is 3130572011305.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 901460999209 + 4129641751104 = 949453^2 + 2032152^2 .
It is a cyclic number.
It is not a de Polignac number, because 5031102750313 - 25 = 5031102750281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5031102750383) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2094546156 + ... + 2094548557.
It is an arithmetic number, because the mean of its divisors is an integer number (1258822961557).
Almost surely, 25031102750313 is an apocalyptic number.
It is an amenable number.
5031102750313 is a deficient number, since it is larger than the sum of its proper divisors (4189095915).
5031102750313 is a wasteful number, since it uses less digits than its factorization.
5031102750313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4189095914.
The product of its (nonzero) digits is 9450, while the sum is 31.
Adding to 5031102750313 its reverse (3130572011305), we get a palindrome (8161674761618).
The spelling of 5031102750313 in words is "five trillion, thirty-one billion, one hundred two million, seven hundred fifty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •