Base | Representation |
---|---|
bin | 111110110110011… |
… | …000101111001101 |
3 | 2201111010022220202 |
4 | 332312120233031 |
5 | 4124414210433 |
6 | 252344223245 |
7 | 35062426124 |
oct | 7666305715 |
9 | 2644108822 |
10 | 1054444493 |
11 | 4a122a833 |
12 | 25516ab25 |
13 | 13a5c056b |
14 | a0080abb |
15 | 62887ee8 |
hex | 3ed98bcd |
1054444493 has 2 divisors, whose sum is σ = 1054444494. Its totient is φ = 1054444492.
The previous prime is 1054444477. The next prime is 1054444511. The reversal of 1054444493 is 3944444501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1016461924 + 37982569 = 31882^2 + 6163^2 .
It is a cyclic number.
It is not a de Polignac number, because 1054444493 - 24 = 1054444477 is a prime.
It is a super-2 number, since 2×10544444932 = 2223706377636054098, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1054444403) 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, 527222246 + 527222247.
It is an arithmetic number, because the mean of its divisors is an integer number (527222247).
Almost surely, 21054444493 is an apocalyptic number.
It is an amenable number.
1054444493 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054444493 is an equidigital number, since it uses as much as digits as its factorization.
1054444493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 138240, while the sum is 38.
The square root of 1054444493 is about 32472.2110888680. The cubic root of 1054444493 is about 1017.8284227388.
Adding to 1054444493 its reverse (3944444501), we get a palindrome (4998888994).
The spelling of 1054444493 in words is "one billion, fifty-four million, four hundred forty-four thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •