Base | Representation |
---|---|
bin | 111111101110000… |
… | …111010100101011 |
3 | 2202111121112022222 |
4 | 333232013110223 |
5 | 4142134200402 |
6 | 254025304255 |
7 | 35330542154 |
oct | 7756072453 |
9 | 2674545288 |
10 | 1069053227 |
11 | 4a94a8570 |
12 | 25a03508b |
13 | 140636a98 |
14 | a1da492b |
15 | 63cc17a2 |
hex | 3fb8752b |
1069053227 has 4 divisors (see below), whose sum is σ = 1166239896. Its totient is φ = 971866560.
The previous prime is 1069053203. The next prime is 1069053277. The reversal of 1069053227 is 7223509601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1069053227 - 224 = 1052276011 is a prime.
It is a super-2 number, since 2×10690532272 = 2285749604318227058, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1069053277) 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 in 3 ways as a sum of consecutive naturals, for example, 48593318 + ... + 48593339.
It is an arithmetic number, because the mean of its divisors is an integer number (291559974).
Almost surely, 21069053227 is an apocalyptic number.
1069053227 is a deficient number, since it is larger than the sum of its proper divisors (97186669).
1069053227 is an equidigital number, since it uses as much as digits as its factorization.
1069053227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97186668.
The product of its (nonzero) digits is 22680, while the sum is 35.
The square root of 1069053227 is about 32696.3794172994. The cubic root of 1069053227 is about 1022.5073604562.
The spelling of 1069053227 in words is "one billion, sixty-nine million, fifty-three thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •