Base | Representation |
---|---|
bin | 10001110000011010101… |
… | …01100010111101001001 |
3 | 2011022210112220221201011 |
4 | 20320031111202331021 |
5 | 34444000412424131 |
6 | 1144140311323521 |
7 | 62036033565136 |
oct | 10701525427511 |
9 | 2138715827634 |
10 | 610109108041 |
11 | 215822760044 |
12 | 9a2b03805a1 |
13 | 456c112a044 |
14 | 2175aac958d |
15 | 10d0c5ce0b1 |
hex | 8e0d562f49 |
610109108041 has 8 divisors (see below), whose sum is σ = 610685626304. Its totient is φ = 609532713360.
The previous prime is 610109108033. The next prime is 610109108099. The reversal of 610109108041 is 140801901016.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 610109108041 - 23 = 610109108033 is a prime.
It is a super-2 number, since 2×6101091080412 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 610109107994 and 610109108012.
It is not an unprimeable number, because it can be changed into a prime (610109108641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12020980 + ... + 12071626.
It is an arithmetic number, because the mean of its divisors is an integer number (76335703288).
Almost surely, 2610109108041 is an apocalyptic number.
It is an amenable number.
610109108041 is a deficient number, since it is larger than the sum of its proper divisors (576518263).
610109108041 is a wasteful number, since it uses less digits than its factorization.
610109108041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61791.
The product of its (nonzero) digits is 1728, while the sum is 31.
The spelling of 610109108041 in words is "six hundred ten billion, one hundred nine million, one hundred eight thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •