Base | Representation |
---|---|
bin | 11011110000110010101011… |
… | …00101011000111010111101 |
3 | 22000011022222111200221220021 |
4 | 31320121111211120322331 |
5 | 31000221101324310414 |
6 | 333502010151252141 |
7 | 15600503262310351 |
oct | 1570312545307275 |
9 | 260138874627807 |
10 | 61050101010109 |
11 | 184a82254a1482 |
12 | 6a1bb0337a051 |
13 | 280accc7c2233 |
14 | 1110baaa85461 |
15 | 70d0be9b2c24 |
hex | 378655958ebd |
61050101010109 has 2 divisors, whose sum is σ = 61050101010110. Its totient is φ = 61050101010108.
The previous prime is 61050101010079. The next prime is 61050101010169. The reversal of 61050101010109 is 90101010105016.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 34788350367225 + 26261750642884 = 5898165^2 + 5124622^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-61050101010109 is a prime.
It is a super-2 number, since 2×610501010101092 (a number of 28 digits) contains 22 as substring.
It is an alternating number because its digits alternate between even and odd.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61050101010169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30525050505054 + 30525050505055.
It is an arithmetic number, because the mean of its divisors is an integer number (30525050505055).
Almost surely, 261050101010109 is an apocalyptic number.
It is an amenable number.
61050101010109 is a deficient number, since it is larger than the sum of its proper divisors (1).
61050101010109 is an equidigital number, since it uses as much as digits as its factorization.
61050101010109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 270, while the sum is 25.
The spelling of 61050101010109 in words is "sixty-one trillion, fifty billion, one hundred one million, ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •