Base | Representation |
---|---|
bin | 11000101111101010001010… |
… | …01011110111100100100011 |
3 | 21010122221022021201021221012 |
4 | 30113311011023313210203 |
5 | 24113010034430142011 |
6 | 311421254301451135 |
7 | 14314201105360046 |
oct | 1427650513674443 |
9 | 233587267637835 |
10 | 54414101412131 |
11 | 1637998874676a |
12 | 6129998570aab |
13 | 24492c6485096 |
14 | d61929860c5d |
15 | 6456804c9a8b |
hex | 317d452f7923 |
54414101412131 has 4 divisors (see below), whose sum is σ = 54436614489192. Its totient is φ = 54391588335072.
The previous prime is 54414101412103. The next prime is 54414101412197. The reversal of 54414101412131 is 13121410141445.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 54414101412131 - 214 = 54414101395747 is a prime.
It is a super-2 number, since 2×544141014121312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (54414101492131) 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, 11256534905 + ... + 11256539738.
It is an arithmetic number, because the mean of its divisors is an integer number (13609153622298).
Almost surely, 254414101412131 is an apocalyptic number.
54414101412131 is a deficient number, since it is larger than the sum of its proper divisors (22513077061).
54414101412131 is a wasteful number, since it uses less digits than its factorization.
54414101412131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22513077060.
The product of its (nonzero) digits is 7680, while the sum is 32.
Adding to 54414101412131 its reverse (13121410141445), we get a palindrome (67535511553576).
The spelling of 54414101412131 in words is "fifty-four trillion, four hundred fourteen billion, one hundred one million, four hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •