Base | Representation |
---|---|
bin | 111101100100010100111001… |
… | …0101011000110100100101101 |
3 | 2122000111002102210201210020001 |
4 | 1323020221302223012210231 |
5 | 1031440311302131120011 |
6 | 5155442344534224301 |
7 | 222033003435263212 |
oct | 17310516253064455 |
9 | 2560432383653201 |
10 | 541554350254381 |
11 | 147612a01475832 |
12 | 508a4a401b5091 |
13 | 1a32448247b089 |
14 | 97a352857bb09 |
15 | 42921112187c1 |
hex | 1ec8a72ac692d |
541554350254381 has 2 divisors, whose sum is σ = 541554350254382. Its totient is φ = 541554350254380.
The previous prime is 541554350254339. The next prime is 541554350254397. The reversal of 541554350254381 is 183452053455145.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 417452321722500 + 124102028531881 = 20431650^2 + 11140109^2 .
It is a cyclic number.
It is not a de Polignac number, because 541554350254381 - 215 = 541554350221613 is a prime.
It is a super-2 number, since 2×5415543502543812 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (541554350254481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 270777175127190 + 270777175127191.
It is an arithmetic number, because the mean of its divisors is an integer number (270777175127191).
Almost surely, 2541554350254381 is an apocalyptic number.
It is an amenable number.
541554350254381 is a deficient number, since it is larger than the sum of its proper divisors (1).
541554350254381 is an equidigital number, since it uses as much as digits as its factorization.
541554350254381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800000, while the sum is 55.
The spelling of 541554350254381 in words is "five hundred forty-one trillion, five hundred fifty-four billion, three hundred fifty million, two hundred fifty-four thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •