Base | Representation |
---|---|
bin | 11101011011010110011… |
… | …01101000011010010001 |
3 | 10120122212102020021111000 |
4 | 32231223031220122101 |
5 | 113031231202100230 |
6 | 2052300022012213 |
7 | 133023253422162 |
oct | 16555315503221 |
9 | 3518772207430 |
10 | 1011116050065 |
11 | 35a8a2717930 |
12 | 143b64877069 |
13 | 7446a266264 |
14 | 36d1c8c5769 |
15 | 1b47c5cab60 |
hex | eb6b368691 |
1011116050065 has 64 divisors (see below), whose sum is σ = 1964061849600. Its totient is φ = 489460708800.
The previous prime is 1011116050051. The next prime is 1011116050067. The reversal of 1011116050065 is 5600506111101.
It is not a de Polignac number, because 1011116050065 - 26 = 1011116050001 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1011116050067) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 397506 + ... + 1476564.
It is an arithmetic number, because the mean of its divisors is an integer number (30688466400).
Almost surely, 21011116050065 is an apocalyptic number.
1011116050065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1011116050065 is a deficient number, since it is larger than the sum of its proper divisors (952945799535).
1011116050065 is a wasteful number, since it uses less digits than its factorization.
1011116050065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1079715 (or 1079709 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
The spelling of 1011116050065 in words is "one trillion, eleven billion, one hundred sixteen million, fifty thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •