Base | Representation |
---|---|
bin | 11111000111100101000… |
… | …10100000010011101101 |
3 | 10210012211211222121221012 |
4 | 33203302202200103231 |
5 | 120004231040132114 |
6 | 2135105433115005 |
7 | 140151202502426 |
oct | 17436242402355 |
9 | 3705754877835 |
10 | 1069221020909 |
11 | 3824aa434498 |
12 | 15327bb58a65 |
13 | 79a9a210302 |
14 | 39a7180664d |
15 | 1cc2d7a363e |
hex | f8f28a04ed |
1069221020909 has 2 divisors, whose sum is σ = 1069221020910. Its totient is φ = 1069221020908.
The previous prime is 1069221020899. The next prime is 1069221020927. The reversal of 1069221020909 is 9090201229601.
It is a happy number.
1069221020909 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1067870090884 + 1350930025 = 1033378^2 + 36755^2 .
It is a cyclic number.
It is not a de Polignac number, because 1069221020909 - 24 = 1069221020893 is a prime.
It is a super-2 number, since 2×10692210209092 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1069221020009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 534610510454 + 534610510455.
It is an arithmetic number, because the mean of its divisors is an integer number (534610510455).
Almost surely, 21069221020909 is an apocalyptic number.
It is an amenable number.
1069221020909 is a deficient number, since it is larger than the sum of its proper divisors (1).
1069221020909 is an equidigital number, since it uses as much as digits as its factorization.
1069221020909 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34992, while the sum is 41.
The spelling of 1069221020909 in words is "one trillion, sixty-nine billion, two hundred twenty-one million, twenty thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •