Base | Representation |
---|---|
bin | 111101100100011001011001… |
… | …1101001101010010100100111 |
3 | 2122000112000102102111120210212 |
4 | 1323020302303221222110213 |
5 | 1031440441113231031101 |
6 | 5155451025252010035 |
7 | 222033465346463363 |
oct | 17310626351522447 |
9 | 2560460372446725 |
10 | 541564030330151 |
11 | 147617019637a54 |
12 | 508a68a200091b |
13 | 1a325365ab296a |
14 | 97a3ba60222a3 |
15 | 42924cae7e1bb |
hex | 1ec8cb3a6a527 |
541564030330151 has 2 divisors, whose sum is σ = 541564030330152. Its totient is φ = 541564030330150.
The previous prime is 541564030330091. The next prime is 541564030330153. The reversal of 541564030330151 is 151033030465145.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 541564030330151 - 214 = 541564030313767 is a prime.
Together with 541564030330153, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 541564030330099 and 541564030330108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (541564030330153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 270782015165075 + 270782015165076.
It is an arithmetic number, because the mean of its divisors is an integer number (270782015165076).
Almost surely, 2541564030330151 is an apocalyptic number.
541564030330151 is a deficient number, since it is larger than the sum of its proper divisors (1).
541564030330151 is an equidigital number, since it uses as much as digits as its factorization.
541564030330151 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324000, while the sum is 41.
Adding to 541564030330151 its reverse (151033030465145), we get a palindrome (692597060795296).
The spelling of 541564030330151 in words is "five hundred forty-one trillion, five hundred sixty-four billion, thirty million, three hundred thirty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •