Base | Representation |
---|---|
bin | 1010011110010111011010… |
… | …0110000110011011111001 |
3 | 1111202222212101102102002222 |
4 | 2213211312212012123321 |
5 | 3002142400014114042 |
6 | 40254424333133425 |
7 | 2266026652315331 |
oct | 247456646063371 |
9 | 44688771372088 |
10 | 11516797019897 |
11 | 3740278748034 |
12 | 136004802a275 |
13 | 65704c4a6650 |
14 | 2bb5b751c0c1 |
15 | 14e8a1c6c2d2 |
hex | a79769866f9 |
11516797019897 has 8 divisors (see below), whose sum is σ = 12802791724800. Its totient is φ = 10287957635280.
The previous prime is 11516797019879. The next prime is 11516797019983. The reversal of 11516797019897 is 79891079761511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11516797019897 - 220 = 11516795971321 is a prime.
It is a super-2 number, since 2×115167970198972 (a number of 27 digits) contains 22 as substring.
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 11516797019897.
It is not an unprimeable number, because it can be changed into a prime (11516797019297) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14288829647 + ... + 14288830452.
It is an arithmetic number, because the mean of its divisors is an integer number (1600348965600).
Almost surely, 211516797019897 is an apocalyptic number.
It is an amenable number.
11516797019897 is a deficient number, since it is larger than the sum of its proper divisors (1285994704903).
11516797019897 is a wasteful number, since it uses less digits than its factorization.
11516797019897 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28577660143.
The product of its (nonzero) digits is 60011280, while the sum is 71.
The spelling of 11516797019897 in words is "eleven trillion, five hundred sixteen billion, seven hundred ninety-seven million, nineteen thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •