Base | Representation |
---|---|
bin | 101100011110011100110… |
… | …0111011100000011001111 |
3 | 210122100221221001221122102 |
4 | 1120330321213130003033 |
5 | 1300122310001231111 |
6 | 21000045444305315 |
7 | 1200425350034363 |
oct | 130747147340317 |
9 | 23570857057572 |
10 | 6112705102031 |
11 | 1a47424743780 |
12 | 8288246a223b |
13 | 35456c10b798 |
14 | 171bdc3732a3 |
15 | a90137c213b |
hex | 58f399dc0cf |
6112705102031 has 8 divisors (see below), whose sum is σ = 6694972921728. Its totient is φ = 5534865175000.
The previous prime is 6112705102013. The next prime is 6112705102033. The reversal of 6112705102031 is 1302015072116.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6112705102031 is a prime.
It is a super-2 number, since 2×61127051020312 (a number of 26 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 = 6112705101985 and 6112705102003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6112705102033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1106970275 + ... + 1106975796.
It is an arithmetic number, because the mean of its divisors is an integer number (836871615216).
Almost surely, 26112705102031 is an apocalyptic number.
6112705102031 is a deficient number, since it is larger than the sum of its proper divisors (582267819697).
6112705102031 is a wasteful number, since it uses less digits than its factorization.
6112705102031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2213946333.
The product of its (nonzero) digits is 2520, while the sum is 29.
The spelling of 6112705102031 in words is "six trillion, one hundred twelve billion, seven hundred five million, one hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •