Base | Representation |
---|---|
bin | 11111100101001110001… |
… | …11111011101000000001 |
3 | 10211201220222010200101211 |
4 | 33302213013323220001 |
5 | 120234324210223042 |
6 | 2150300542330121 |
7 | 141253446456211 |
oct | 17624707735001 |
9 | 3751828120354 |
10 | 1085135632897 |
11 | 389226858a88 |
12 | 156381889941 |
13 | 7b43539a894 |
14 | 3a7412ac241 |
15 | 1d360a2e017 |
hex | fca71fba01 |
1085135632897 has 2 divisors, whose sum is σ = 1085135632898. Its totient is φ = 1085135632896.
The previous prime is 1085135632831. The next prime is 1085135632907. The reversal of 1085135632897 is 7982365315801.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 826661005681 + 258474627216 = 909209^2 + 508404^2 .
It is an emirp because it is prime and its reverse (7982365315801) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1085135632897 is a prime.
It is a super-3 number, since 3×10851356328973 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (1085135632597) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 542567816448 + 542567816449.
It is an arithmetic number, because the mean of its divisors is an integer number (542567816449).
Almost surely, 21085135632897 is an apocalyptic number.
It is an amenable number.
1085135632897 is a deficient number, since it is larger than the sum of its proper divisors (1).
1085135632897 is an equidigital number, since it uses as much as digits as its factorization.
1085135632897 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10886400, while the sum is 58.
The spelling of 1085135632897 in words is "one trillion, eighty-five billion, one hundred thirty-five million, six hundred thirty-two thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •