Base | Representation |
---|---|
bin | 100000000010110… |
… | …1010100111000001 |
3 | 2202221020012020221 |
4 | 1000011222213001 |
5 | 4200224231243 |
6 | 254405503041 |
7 | 35434164544 |
oct | 10005524701 |
9 | 2687205227 |
10 | 1075227073 |
11 | 501a35018 |
12 | 260111a81 |
13 | 1419b8c4b |
14 | a2b3085b |
15 | 645e0bed |
hex | 4016a9c1 |
1075227073 has 2 divisors, whose sum is σ = 1075227074. Its totient is φ = 1075227072.
The previous prime is 1075227071. The next prime is 1075227079. The reversal of 1075227073 is 3707225701.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1036389249 + 38837824 = 32193^2 + 6232^2 .
It is a cyclic number.
It is not a de Polignac number, because 1075227073 - 21 = 1075227071 is a prime.
It is a super-2 number, since 2×10752270732 = 2312226517024294658, which contains 22 as substring.
Together with 1075227071, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1075227071) 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, 537613536 + 537613537.
It is an arithmetic number, because the mean of its divisors is an integer number (537613537).
Almost surely, 21075227073 is an apocalyptic number.
It is an amenable number.
1075227073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1075227073 is an equidigital number, since it uses as much as digits as its factorization.
1075227073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20580, while the sum is 34.
The square root of 1075227073 is about 32790.6552694514. The cubic root of 1075227073 is about 1024.4719304098.
The spelling of 1075227073 in words is "one billion, seventy-five million, two hundred twenty-seven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •