Base | Representation |
---|---|
bin | 100000010010000… |
… | …010111001011001 |
3 | 1101202010012101222 |
4 | 200102002321121 |
5 | 2102122220434 |
6 | 125424221425 |
7 | 16264351511 |
oct | 4022027131 |
9 | 1352105358 |
10 | 541601369 |
11 | 2587a1141 |
12 | 13146a875 |
13 | 8828c7aa |
14 | 51d04841 |
15 | 3283472e |
hex | 20482e59 |
541601369 has 2 divisors, whose sum is σ = 541601370. Its totient is φ = 541601368.
The previous prime is 541601339. The next prime is 541601399. The reversal of 541601369 is 963106145.
It is a balanced prime because it is at equal distance from previous prime (541601339) and next prime (541601399).
It can be written as a sum of positive squares in only one way, i.e., 420865225 + 120736144 = 20515^2 + 10988^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-541601369 is a prime.
It is a super-2 number, since 2×5416013692 = 586664085805348322, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (541601339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 270800684 + 270800685.
It is an arithmetic number, because the mean of its divisors is an integer number (270800685).
Almost surely, 2541601369 is an apocalyptic number.
It is an amenable number.
541601369 is a deficient number, since it is larger than the sum of its proper divisors (1).
541601369 is an equidigital number, since it uses as much as digits as its factorization.
541601369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 35.
The square root of 541601369 is about 23272.3305450915. The cubic root of 541601369 is about 815.1294506258.
The spelling of 541601369 in words is "five hundred forty-one million, six hundred one thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •