Base | Representation |
---|---|
bin | 100110111110000101010… |
… | …0000100000010001111101 |
3 | 200222000202212212212120001 |
4 | 1031330022200200101331 |
5 | 1200223042112323401 |
6 | 15220302422554301 |
7 | 1061646454114642 |
oct | 115741240402175 |
9 | 20860685785501 |
10 | 5356000511101 |
11 | 1785515726699 |
12 | 726041898991 |
13 | 2cb0b7b7a176 |
14 | 14733611bdc9 |
15 | 944c645e601 |
hex | 4df0a82047d |
5356000511101 has 32 divisors (see below), whose sum is σ = 5627869175808. Its totient is φ = 5092698411840.
The previous prime is 5356000511093. The next prime is 5356000511111. The reversal of 5356000511101 is 1011150006535.
It is not a de Polignac number, because 5356000511101 - 23 = 5356000511093 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 5356000511101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5356000511111) 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 31 ways as a sum of consecutive naturals, for example, 891030186 + ... + 891036196.
It is an arithmetic number, because the mean of its divisors is an integer number (175870911744).
Almost surely, 25356000511101 is an apocalyptic number.
It is an amenable number.
5356000511101 is a deficient number, since it is larger than the sum of its proper divisors (271868664707).
5356000511101 is a wasteful number, since it uses less digits than its factorization.
5356000511101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9561.
The product of its (nonzero) digits is 2250, while the sum is 28.
Adding to 5356000511101 its reverse (1011150006535), we get a palindrome (6367150517636).
The spelling of 5356000511101 in words is "five trillion, three hundred fifty-six billion, five hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •