Base | Representation |
---|---|
bin | 111110110110011… |
… | …000011000010111 |
3 | 2201111010020220121 |
4 | 332312120120113 |
5 | 4124414134111 |
6 | 252344212411 |
7 | 35062421635 |
oct | 7666303027 |
9 | 2644106817 |
10 | 1054443031 |
11 | 4a1229724 |
12 | 25516a107 |
13 | 13a5bc9b5 |
14 | a0080355 |
15 | 62887871 |
hex | 3ed98617 |
1054443031 has 2 divisors, whose sum is σ = 1054443032. Its totient is φ = 1054443030.
The previous prime is 1054443029. The next prime is 1054443041. The reversal of 1054443031 is 1303444501.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1054443031 - 21 = 1054443029 is a prime.
It is a super-2 number, since 2×10544430312 = 2223700211248933922, which contains 22 as substring.
Together with 1054443029, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1054442987 and 1054443005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1054443041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527221515 + 527221516.
It is an arithmetic number, because the mean of its divisors is an integer number (527221516).
Almost surely, 21054443031 is an apocalyptic number.
1054443031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054443031 is an equidigital number, since it uses as much as digits as its factorization.
1054443031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 1054443031 is about 32472.1885773041. The cubic root of 1054443031 is about 1017.8279523281.
Adding to 1054443031 its reverse (1303444501), we get a palindrome (2357887532).
The spelling of 1054443031 in words is "one billion, fifty-four million, four hundred forty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •