Base | Representation |
---|---|
bin | 101100011000100011111… |
… | …1100000111010001000101 |
3 | 210121011022201000122222222 |
4 | 1120301013330013101011 |
5 | 1244420410442013221 |
6 | 20550155030502125 |
7 | 1166500120511462 |
oct | 130610774072105 |
9 | 23534281018888 |
10 | 6100060501061 |
11 | 1a4202614092a |
12 | 826295b04945 |
13 | 353305563587 |
14 | 17135ccbc669 |
15 | a8a236739ab |
hex | 58c47f07445 |
6100060501061 has 4 divisors (see below), whose sum is σ = 6123796145292. Its totient is φ = 6076324856832.
The previous prime is 6100060501057. The next prime is 6100060501121. The reversal of 6100060501061 is 1601050600016.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3389078493025 + 2710982008036 = 1840945^2 + 1646506^2 .
It is a cyclic number.
It is not a de Polignac number, because 6100060501061 - 22 = 6100060501057 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6100060501061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6100060501261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11867821730 + ... + 11867822243.
It is an arithmetic number, because the mean of its divisors is an integer number (1530949036323).
Almost surely, 26100060501061 is an apocalyptic number.
It is an amenable number.
6100060501061 is a deficient number, since it is larger than the sum of its proper divisors (23735644231).
6100060501061 is a wasteful number, since it uses less digits than its factorization.
6100060501061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23735644230.
The product of its (nonzero) digits is 1080, while the sum is 26.
The spelling of 6100060501061 in words is "six trillion, one hundred billion, sixty million, five hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •