Base | Representation |
---|---|
bin | 100100110001000110101… |
… | …0000000100101101001011 |
3 | 122220002022202220112120221 |
4 | 1021202031100010231023 |
5 | 1130243024320404011 |
6 | 14425233121330511 |
7 | 1031041164456430 |
oct | 111421520045513 |
9 | 18802282815527 |
10 | 5053251341131 |
11 | 167908770a2a4 |
12 | 69742b796a37 |
13 | 2a869a60a486 |
14 | 136815c27b87 |
15 | 8b6a7756971 |
hex | 4988d404b4b |
5053251341131 has 16 divisors (see below), whose sum is σ = 5885754072768. Its totient is φ = 4248446716800.
The previous prime is 5053251341129. The next prime is 5053251341137. The reversal of 5053251341131 is 1311431523505.
It is a cyclic number.
It is not a de Polignac number, because 5053251341131 - 21 = 5053251341129 is a prime.
It is a super-2 number, since 2×50532513411312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5053251341137) 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 15 ways as a sum of consecutive naturals, for example, 573240 + ... + 3230341.
It is an arithmetic number, because the mean of its divisors is an integer number (367859629548).
Almost surely, 25053251341131 is an apocalyptic number.
5053251341131 is a deficient number, since it is larger than the sum of its proper divisors (832502731637).
5053251341131 is a wasteful number, since it uses less digits than its factorization.
5053251341131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3807222.
The product of its (nonzero) digits is 27000, while the sum is 34.
Adding to 5053251341131 its reverse (1311431523505), we get a palindrome (6364682864636).
The spelling of 5053251341131 in words is "five trillion, fifty-three billion, two hundred fifty-one million, three hundred forty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •