Base | Representation |
---|---|
bin | 11110110111100010101… |
… | …01000111100111010101 |
3 | 10202101121210100002102122 |
4 | 33123301111013213111 |
5 | 114334112331100320 |
6 | 2131123214145325 |
7 | 136424632024004 |
oct | 17336125074725 |
9 | 3671553302378 |
10 | 1060610800085 |
11 | 379891168111 |
12 | 1516784b2245 |
13 | 790274333a5 |
14 | 39496094c3b |
15 | 1c8c791bd25 |
hex | f6f15479d5 |
1060610800085 has 4 divisors (see below), whose sum is σ = 1272732960108. Its totient is φ = 848488640064.
The previous prime is 1060610800031. The next prime is 1060610800103. The reversal of 1060610800085 is 5800080160601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 422923906276 + 637686893809 = 650326^2 + 798553^2 .
It is a cyclic number.
It is not a de Polignac number, because 1060610800085 - 26 = 1060610800021 is a prime.
It is a super-2 number, since 2×10606108000852 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 106061080004 + ... + 106061080013.
It is an arithmetic number, because the mean of its divisors is an integer number (318183240027).
Almost surely, 21060610800085 is an apocalyptic number.
It is an amenable number.
1060610800085 is a deficient number, since it is larger than the sum of its proper divisors (212122160023).
1060610800085 is an equidigital number, since it uses as much as digits as its factorization.
1060610800085 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212122160022.
The product of its (nonzero) digits is 11520, while the sum is 35.
Adding to 1060610800085 its reverse (5800080160601), we get a palindrome (6860690960686).
The spelling of 1060610800085 in words is "one trillion, sixty billion, six hundred ten million, eight hundred thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •