Base | Representation |
---|---|
bin | 11111000111111111110… |
… | …10111110110011000101 |
3 | 10210020102111110102200101 |
4 | 33203333322332303011 |
5 | 120010211024303221 |
6 | 2135144013244101 |
7 | 140156600053222 |
oct | 17437772766305 |
9 | 3706374412611 |
10 | 1069445541061 |
11 | 382605144837 |
12 | 153323193631 |
13 | 79b048a1281 |
14 | 39a9356c949 |
15 | 1cc43352d91 |
hex | f8ffebecc5 |
1069445541061 has 2 divisors, whose sum is σ = 1069445541062. Its totient is φ = 1069445541060.
The previous prime is 1069445540987. The next prime is 1069445541107. The reversal of 1069445541061 is 1601455449601.
It is an a-pointer prime, because the next prime (1069445541107) can be obtained adding 1069445541061 to its sum of digits (46).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 991956240900 + 77489300161 = 995970^2 + 278369^2 .
It is a cyclic number.
It is not a de Polignac number, because 1069445541061 - 29 = 1069445540549 is a prime.
It is a super-2 number, since 2×10694455410612 (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 (1069445511061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 534722770530 + 534722770531.
It is an arithmetic number, because the mean of its divisors is an integer number (534722770531).
Almost surely, 21069445541061 is an apocalyptic number.
It is an amenable number.
1069445541061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1069445541061 is an equidigital number, since it uses as much as digits as its factorization.
1069445541061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 518400, while the sum is 46.
The spelling of 1069445541061 in words is "one trillion, sixty-nine billion, four hundred forty-five million, five hundred forty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •