Base | Representation |
---|---|
bin | 110010011010011101… |
… | …011001001011110111 |
3 | 12011201111000220222121 |
4 | 302122131121023313 |
5 | 1341330014113101 |
6 | 40511211140411 |
7 | 3624262641430 |
oct | 623235311367 |
9 | 164644026877 |
10 | 54131004151 |
11 | 20a585a4674 |
12 | a5a8444707 |
13 | 514886bc93 |
14 | 2897226487 |
15 | 161c3960a1 |
hex | c9a7592f7 |
54131004151 has 4 divisors (see below), whose sum is σ = 61864004752. Its totient is φ = 46398003552.
The previous prime is 54131004119. The next prime is 54131004157. The reversal of 54131004151 is 15140013145.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15140013145 = 5 ⋅3028002629.
It is a cyclic number.
It is not a de Polignac number, because 54131004151 - 25 = 54131004119 is a prime.
It is a super-4 number, since 4×541310041514 (a number of 44 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54131004157) 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, 3866500290 + ... + 3866500303.
It is an arithmetic number, because the mean of its divisors is an integer number (15466001188).
Almost surely, 254131004151 is an apocalyptic number.
54131004151 is a deficient number, since it is larger than the sum of its proper divisors (7733000601).
54131004151 is an equidigital number, since it uses as much as digits as its factorization.
54131004151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7733000600.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 54131004151 its reverse (15140013145), we get a palindrome (69271017296).
The spelling of 54131004151 in words is "fifty-four billion, one hundred thirty-one million, four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •