Base | Representation |
---|---|
bin | 101100011011000111110… |
… | …1111000010101001001101 |
3 | 210121200111222022012210122 |
4 | 1120312033233002221031 |
5 | 1300013141330013401 |
6 | 20552504444114325 |
7 | 1200053316501341 |
oct | 130661757025115 |
9 | 23550458265718 |
10 | 6105560001101 |
11 | 1a443984a3690 |
12 | 82736b8359a5 |
13 | 3539a0a30802 |
14 | 171721445621 |
15 | a8c4639521b |
hex | 58d8fbc2a4d |
6105560001101 has 8 divisors (see below), whose sum is σ = 6673696596000. Its totient is φ = 5539604353840.
The previous prime is 6105560001061. The next prime is 6105560001119. The reversal of 6105560001101 is 1011000655016.
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-6105560001101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6105560001181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 545231051 + ... + 545242248.
It is an arithmetic number, because the mean of its divisors is an integer number (834212074500).
Almost surely, 26105560001101 is an apocalyptic number.
It is an amenable number.
6105560001101 is a deficient number, since it is larger than the sum of its proper divisors (568136594899).
6105560001101 is a wasteful number, since it uses less digits than its factorization.
6105560001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1090473819.
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 6105560001101 its reverse (1011000655016), we get a palindrome (7116560656117).
The spelling of 6105560001101 in words is "six trillion, one hundred five billion, five hundred sixty million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •