Base | Representation |
---|---|
bin | 11000110010110101001100… |
… | …10100001001000000000111 |
3 | 21011001100122221111001202002 |
4 | 30121122212110021000013 |
5 | 24121301304404344111 |
6 | 311543322502135515 |
7 | 14325110242030034 |
oct | 1431324624110007 |
9 | 234040587431662 |
10 | 54523105153031 |
11 | 16411134498649 |
12 | 6146b3972159b |
13 | 2456678454758 |
14 | d66d0a5cc38b |
15 | 64840edce63b |
hex | 3196a6509007 |
54523105153031 has 2 divisors, whose sum is σ = 54523105153032. Its totient is φ = 54523105153030.
The previous prime is 54523105153019. The next prime is 54523105153103. The reversal of 54523105153031 is 13035150132545.
Together with next prime (54523105153103) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 54523105153031 - 242 = 50125058641927 is a prime.
It is a super-2 number, since 2×545231051530312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (54523105153001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27261552576515 + 27261552576516.
It is an arithmetic number, because the mean of its divisors is an integer number (27261552576516).
Almost surely, 254523105153031 is an apocalyptic number.
54523105153031 is a deficient number, since it is larger than the sum of its proper divisors (1).
54523105153031 is an equidigital number, since it uses as much as digits as its factorization.
54523105153031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 135000, while the sum is 38.
Adding to 54523105153031 its reverse (13035150132545), we get a palindrome (67558255285576).
The spelling of 54523105153031 in words is "fifty-four trillion, five hundred twenty-three billion, one hundred five million, one hundred fifty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •