Base | Representation |
---|---|
bin | 1001010110110011… |
… | …01110011001110011 |
3 | 110222001220111200012 |
4 | 10223121232121303 |
5 | 40241410200001 |
6 | 2150235045135 |
7 | 235322624345 |
oct | 45331563163 |
9 | 13861814605 |
10 | 5023131251 |
11 | 2148476946 |
12 | b822a07ab |
13 | 62089a318 |
14 | 3591a3295 |
15 | 1e5ec52bb |
hex | 12b66e673 |
5023131251 has 18 divisors (see below), whose sum is σ = 5417477100. Its totient is φ = 4656766392.
The previous prime is 5023131229. The next prime is 5023131263. The reversal of 5023131251 is 1521313205.
It is a happy number.
5023131251 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5023131251 - 214 = 5023114867 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5023131271) 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 17 ways as a sum of consecutive naturals, for example, 794300 + ... + 800598.
It is an arithmetic number, because the mean of its divisors is an integer number (300970950).
Almost surely, 25023131251 is an apocalyptic number.
5023131251 is a deficient number, since it is larger than the sum of its proper divisors (394345849).
5023131251 is an equidigital number, since it uses as much as digits as its factorization.
5023131251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6431 (or 6365 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 5023131251 is about 70874.0520289337. The cubic root of 5023131251 is about 1712.6088162584.
Adding to 5023131251 its reverse (1521313205), we get a palindrome (6544444456).
The spelling of 5023131251 in words is "five billion, twenty-three million, one hundred thirty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •