Base | Representation |
---|---|
bin | 100111010011000010110… |
… | …0010010011001001100011 |
3 | 201010022221222011211202202 |
4 | 1032212011202103021203 |
5 | 1201442234122032011 |
6 | 15253105223403415 |
7 | 1065132111443351 |
oct | 116460542231143 |
9 | 21108858154682 |
10 | 5401014252131 |
11 | 17a2614817563 |
12 | 7329048b356b |
13 | 30240c88c8a4 |
14 | 1495a65267d1 |
15 | 9575d1b423b |
hex | 4e985893263 |
5401014252131 has 2 divisors, whose sum is σ = 5401014252132. Its totient is φ = 5401014252130.
The previous prime is 5401014252047. The next prime is 5401014252167. The reversal of 5401014252131 is 1312524101045.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5401014252131 is a prime.
It is a super-2 number, since 2×54010142521312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5401014252094 and 5401014252103.
It is not a weakly prime, because it can be changed into another prime (5401014252181) 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 as a sum of consecutive naturals, namely, 2700507126065 + 2700507126066.
It is an arithmetic number, because the mean of its divisors is an integer number (2700507126066).
Almost surely, 25401014252131 is an apocalyptic number.
5401014252131 is a deficient number, since it is larger than the sum of its proper divisors (1).
5401014252131 is an equidigital number, since it uses as much as digits as its factorization.
5401014252131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 5401014252131 its reverse (1312524101045), we get a palindrome (6713538353176).
The spelling of 5401014252131 in words is "five trillion, four hundred one billion, fourteen million, two hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •