Base | Representation |
---|---|
bin | 101100011000110001000… |
… | …1000101010110101100101 |
3 | 210121012110100000112100012 |
4 | 1120301202020222311211 |
5 | 1244422311000000401 |
6 | 20550310410500005 |
7 | 1166514035264003 |
oct | 130614210526545 |
9 | 23535410015305 |
10 | 6100500000101 |
11 | 1a42231234a81 |
12 | 826399134605 |
13 | 353375624690 |
14 | 1713a1405a73 |
15 | a8a4c03a8bb |
hex | 58c6222ad65 |
6100500000101 has 16 divisors (see below), whose sum is σ = 6796420767360. Its totient is φ = 5436964182720.
The previous prime is 6100500000059. The next prime is 6100500000139. The reversal of 6100500000101 is 1010000050016.
It is a cyclic number.
It is not a de Polignac number, because 6100500000101 - 26 = 6100500000037 is a prime.
It is a super-2 number, since 2×61005000001012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6100500000401) 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 15 ways as a sum of consecutive naturals, for example, 42004856 + ... + 42149838.
It is an arithmetic number, because the mean of its divisors is an integer number (424776297960).
Almost surely, 26100500000101 is an apocalyptic number.
It is an amenable number.
6100500000101 is a deficient number, since it is larger than the sum of its proper divisors (695920767259).
6100500000101 is a wasteful number, since it uses less digits than its factorization.
6100500000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256636.
The product of its (nonzero) digits is 30, while the sum is 14.
Adding to 6100500000101 its reverse (1010000050016), we get a palindrome (7110500050117).
The spelling of 6100500000101 in words is "six trillion, one hundred billion, five hundred million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •