Base | Representation |
---|---|
bin | 100101001011110010101… |
… | …1010010101011110001101 |
3 | 200002120021001200010120222 |
4 | 1022113211122111132031 |
5 | 1132212414120013401 |
6 | 14511432224121125 |
7 | 1035140364523130 |
oct | 112274532253615 |
9 | 20076231603528 |
10 | 5110565001101 |
11 | 16a041879032a |
12 | 6a6565a661a5 |
13 | 2b0c02654641 |
14 | 1394d1a02217 |
15 | 8ce0e221c1b |
hex | 4a5e569578d |
5110565001101 has 32 divisors (see below), whose sum is σ = 6211211715072. Its totient is φ = 4104840130560.
The previous prime is 5110565001077. The next prime is 5110565001103. The reversal of 5110565001101 is 1011005650115.
It is a cyclic number.
It is not a de Polignac number, because 5110565001101 - 218 = 5110564738957 is a prime.
It is a super-2 number, since 2×51105650011012 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5110565001103) 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 31 ways as a sum of consecutive naturals, for example, 32378165 + ... + 32535621.
It is an arithmetic number, because the mean of its divisors is an integer number (194100366096).
Almost surely, 25110565001101 is an apocalyptic number.
It is an amenable number.
5110565001101 is a deficient number, since it is larger than the sum of its proper divisors (1100646713971).
5110565001101 is a wasteful number, since it uses less digits than its factorization.
5110565001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158669.
The product of its (nonzero) digits is 750, while the sum is 26.
The spelling of 5110565001101 in words is "five trillion, one hundred ten billion, five hundred sixty-five million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •