Base | Representation |
---|---|
bin | 1010100011111110001010… |
… | …0010001000111111101111 |
3 | 1112010012102201012111212010 |
4 | 2220333202202020333233 |
5 | 3010232110340423042 |
6 | 40410552212212303 |
7 | 2306006242334604 |
oct | 250774242107757 |
9 | 45105381174763 |
10 | 11613097201647 |
11 | 37780a56879a7 |
12 | 137684290a093 |
13 | 663158627106 |
14 | 2c21110486ab |
15 | 15213b27959c |
hex | a8fe2888fef |
11613097201647 has 8 divisors (see below), whose sum is σ = 16018065105840. Its totient is φ = 7475097049280.
The previous prime is 11613097201631. The next prime is 11613097201709. The reversal of 11613097201647 is 74610279031611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11613097201647 - 24 = 11613097201631 is a prime.
It is a super-2 number, since 2×116130972016472 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11613097201596 and 11613097201605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11613097202647) 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, 66741937854 + ... + 66741938027.
It is an arithmetic number, because the mean of its divisors is an integer number (2002258138230).
Almost surely, 211613097201647 is an apocalyptic number.
11613097201647 is a deficient number, since it is larger than the sum of its proper divisors (4404967904193).
11613097201647 is a wasteful number, since it uses less digits than its factorization.
11613097201647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133483875913.
The product of its (nonzero) digits is 381024, while the sum is 48.
The spelling of 11613097201647 in words is "eleven trillion, six hundred thirteen billion, ninety-seven million, two hundred one thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •