Base | Representation |
---|---|
bin | 111110110101000… |
… | …100101000111011 |
3 | 2201110110211101202 |
4 | 332311010220323 |
5 | 4124322200102 |
6 | 252333004415 |
7 | 35056462631 |
oct | 7665045073 |
9 | 2643424352 |
10 | 1054100027 |
11 | 4a1014a52 |
12 | 25502370b |
13 | 13a4cc836 |
14 | 9ddd1351 |
15 | 6281ae02 |
hex | 3ed44a3b |
1054100027 has 2 divisors, whose sum is σ = 1054100028. Its totient is φ = 1054100026.
The previous prime is 1054099999. The next prime is 1054100029. The reversal of 1054100027 is 7200014501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1054100027 - 216 = 1054034491 is a prime.
It is a super-2 number, since 2×10541000272 = 2222253733842801458, which contains 22 as substring.
Together with 1054100029, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1054099981 and 1054100008.
It is not a weakly prime, because it can be changed into another prime (1054100029) 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, 527050013 + 527050014.
It is an arithmetic number, because the mean of its divisors is an integer number (527050014).
Almost surely, 21054100027 is an apocalyptic number.
1054100027 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054100027 is an equidigital number, since it uses as much as digits as its factorization.
1054100027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 280, while the sum is 20.
The square root of 1054100027 is about 32466.9066435347. The cubic root of 1054100027 is about 1017.7175759142.
Adding to 1054100027 its reverse (7200014501), we get a palindrome (8254114528).
The spelling of 1054100027 in words is "one billion, fifty-four million, one hundred thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •