Base | Representation |
---|---|
bin | 101011000000100100110… |
… | …1110110101000101000101 |
3 | 202221002121120002220121021 |
4 | 1112001021232311011011 |
5 | 1233321424133341401 |
6 | 20323305524551141 |
7 | 1150030603040332 |
oct | 126011156650505 |
9 | 22832546086537 |
10 | 5911112012101 |
11 | 19799856a052a |
12 | 7b57435524b1 |
13 | 33b552a35b5a |
14 | 166156879989 |
15 | a3b655662a1 |
hex | 56049bb5145 |
5911112012101 has 8 divisors (see below), whose sum is σ = 6037425091584. Its totient is φ = 5784821630160.
The previous prime is 5911112012063. The next prime is 5911112012191. The reversal of 5911112012101 is 1012102111195.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5911112012101 - 239 = 5361356198213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5911112012191) 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, 5147445 + ... + 6190186.
It is an arithmetic number, because the mean of its divisors is an integer number (754678136448).
Almost surely, 25911112012101 is an apocalyptic number.
It is an amenable number.
5911112012101 is a deficient number, since it is larger than the sum of its proper divisors (126313079483).
5911112012101 is a wasteful number, since it uses less digits than its factorization.
5911112012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11348771.
The product of its (nonzero) digits is 180, while the sum is 25.
Adding to 5911112012101 its reverse (1012102111195), we get a palindrome (6923214123296).
The spelling of 5911112012101 in words is "five trillion, nine hundred eleven billion, one hundred twelve million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •