Base | Representation |
---|---|
bin | 11010011101010100000101… |
… | …001101111111001100100011 |
3 | 120021000020212220022200021012 |
4 | 122131110011031333030203 |
5 | 110223000211421101311 |
6 | 1051252414443051135 |
7 | 33336665250355550 |
oct | 3235240515771443 |
9 | 507006786280235 |
10 | 116363636503331 |
11 | 340935a5237758 |
12 | 11074076510aab |
13 | 4cc107540b249 |
14 | 20a405c697a27 |
15 | d6bd4297e78b |
hex | 69d50537f323 |
116363636503331 has 16 divisors (see below), whose sum is σ = 136231996615680. Its totient is φ = 97306572179520.
The previous prime is 116363636503229. The next prime is 116363636503399. The reversal of 116363636503331 is 133305636363611.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116363636503331 is a prime.
It is a super-2 number, since 2×1163636365033312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 116363636503331.
It is not an unprimeable number, because it can be changed into a prime (116363636508331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26629430 + ... + 30689636.
It is an arithmetic number, because the mean of its divisors is an integer number (8514499788480).
Almost surely, 2116363636503331 is an apocalyptic number.
116363636503331 is a deficient number, since it is larger than the sum of its proper divisors (19868360112349).
116363636503331 is an equidigital number, since it uses as much as digits as its factorization.
116363636503331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4160114.
The product of its (nonzero) digits is 4723920, while the sum is 50.
The spelling of 116363636503331 in words is "one hundred sixteen trillion, three hundred sixty-three billion, six hundred thirty-six million, five hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •