Base | Representation |
---|---|
bin | 100000000001101… |
… | …1000111110101001 |
3 | 2202220002220000012 |
4 | 1000003120332221 |
5 | 4200101134234 |
6 | 254345021305 |
7 | 35426131505 |
oct | 10003307651 |
9 | 2686086005 |
10 | 1074630569 |
11 | 501667941 |
12 | 25ba84835 |
13 | 14183a59c |
14 | a2a17305 |
15 | 645240ce |
hex | 400d8fa9 |
1074630569 has 2 divisors, whose sum is σ = 1074630570. Its totient is φ = 1074630568.
The previous prime is 1074630563. The next prime is 1074630577. The reversal of 1074630569 is 9650364701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 808549225 + 266081344 = 28435^2 + 16312^2 .
It is an emirp because it is prime and its reverse (9650364701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1074630569 - 212 = 1074626473 is a prime.
It is a super-2 number, since 2×10746305692 = 2309661719658527522, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1074630563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 537315284 + 537315285.
It is an arithmetic number, because the mean of its divisors is an integer number (537315285).
Almost surely, 21074630569 is an apocalyptic number.
It is an amenable number.
1074630569 is a deficient number, since it is larger than the sum of its proper divisors (1).
1074630569 is an equidigital number, since it uses as much as digits as its factorization.
1074630569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 136080, while the sum is 41.
The square root of 1074630569 is about 32781.5583674724. The cubic root of 1074630569 is about 1024.2824465133.
The spelling of 1074630569 in words is "one billion, seventy-four million, six hundred thirty thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •