Base | Representation |
---|---|
bin | 111110110110011… |
… | …001001111001101 |
3 | 2201111010102201121 |
4 | 332312121033031 |
5 | 4124414242131 |
6 | 252344240541 |
7 | 35062435111 |
oct | 7666311715 |
9 | 2644112647 |
10 | 1054446541 |
11 | 4a1231325 |
12 | 255170151 |
13 | 13a5c1485 |
14 | a0081741 |
15 | 62888911 |
hex | 3ed993cd |
1054446541 has 2 divisors, whose sum is σ = 1054446542. Its totient is φ = 1054446540.
The previous prime is 1054446499. The next prime is 1054446557. The reversal of 1054446541 is 1456444501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 859955625 + 194490916 = 29325^2 + 13946^2 .
It is a cyclic number.
It is not a de Polignac number, because 1054446541 - 211 = 1054444493 is a prime.
It is a super-2 number, since 2×10544465412 = 2223715015653729362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1054446497 and 1054446506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1054446571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527223270 + 527223271.
It is an arithmetic number, because the mean of its divisors is an integer number (527223271).
Almost surely, 21054446541 is an apocalyptic number.
It is an amenable number.
1054446541 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054446541 is an equidigital number, since it uses as much as digits as its factorization.
1054446541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38400, while the sum is 34.
The square root of 1054446541 is about 32472.2426235085. The cubic root of 1054446541 is about 1017.8290816991.
The spelling of 1054446541 in words is "one billion, fifty-four million, four hundred forty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •