Base | Representation |
---|---|
bin | 10010101111111011… |
… | …011111010100001111 |
3 | 1220221222220222110001 |
4 | 102233323133110033 |
5 | 312212124224001 |
6 | 13125343225131 |
7 | 1311606505021 |
oct | 225773372417 |
9 | 56858828401 |
10 | 20131476751 |
11 | 85a076a4a1 |
12 | 3a99ba81a7 |
13 | 1b8a9bc629 |
14 | d8d94c011 |
15 | 7cc58c001 |
hex | 4afedf50f |
20131476751 has 2 divisors, whose sum is σ = 20131476752. Its totient is φ = 20131476750.
The previous prime is 20131476713. The next prime is 20131476803. The reversal of 20131476751 is 15767413102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20131476751 - 27 = 20131476623 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20131476751.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20131476251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10065738375 + 10065738376.
It is an arithmetic number, because the mean of its divisors is an integer number (10065738376).
Almost surely, 220131476751 is an apocalyptic number.
20131476751 is a deficient number, since it is larger than the sum of its proper divisors (1).
20131476751 is an equidigital number, since it uses as much as digits as its factorization.
20131476751 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35280, while the sum is 37.
Adding to 20131476751 its reverse (15767413102), we get a palindrome (35898889853).
The spelling of 20131476751 in words is "twenty billion, one hundred thirty-one million, four hundred seventy-six thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •