Base | Representation |
---|---|
bin | 11111100001011010011… |
… | …10011010010000010101 |
3 | 10211112122102212201101112 |
4 | 33300231032122100111 |
5 | 120221132132321434 |
6 | 2145322004304405 |
7 | 141151664304263 |
oct | 17605516322025 |
9 | 3745572781345 |
10 | 1083090510869 |
11 | 3883773a2594 |
12 | 155ab09a2105 |
13 | 7b19a7854c3 |
14 | 3a5c9829433 |
15 | 1d291206dce |
hex | fc2d39a415 |
1083090510869 has 2 divisors, whose sum is σ = 1083090510870. Its totient is φ = 1083090510868.
The previous prime is 1083090510809. The next prime is 1083090510881. The reversal of 1083090510869 is 9680150903801.
It is a happy number.
1083090510869 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 707398744900 + 375691765969 = 841070^2 + 612937^2 .
It is a cyclic number.
It is not a de Polignac number, because 1083090510869 - 236 = 1014371034133 is a prime.
It is a super-2 number, since 2×10830905108692 (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 (1083090510809) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 541545255434 + 541545255435.
It is an arithmetic number, because the mean of its divisors is an integer number (541545255435).
Almost surely, 21083090510869 is an apocalyptic number.
It is an amenable number.
1083090510869 is a deficient number, since it is larger than the sum of its proper divisors (1).
1083090510869 is an equidigital number, since it uses as much as digits as its factorization.
1083090510869 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 466560, while the sum is 50.
The spelling of 1083090510869 in words is "one trillion, eighty-three billion, ninety million, five hundred ten thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •