Base | Representation |
---|---|
bin | 1010000000101010111010… |
… | …0001111101101000011011 |
3 | 1102222020001021100122010222 |
4 | 2200022232201331220123 |
5 | 2420313041343214011 |
6 | 35224213352430255 |
7 | 2214126442221026 |
oct | 240125641755033 |
9 | 42866037318128 |
10 | 11006634351131 |
11 | 3563984170131 |
12 | 12991ab6a838b |
13 | 61abc8a55003 |
14 | 2a0a1c7101bd |
15 | 141493d47ddb |
hex | a02ae87da1b |
11006634351131 has 8 divisors (see below), whose sum is σ = 11013325164240. Its totient is φ = 10999944764928.
The previous prime is 11006634351113. The next prime is 11006634351137. The reversal of 11006634351131 is 13115343660011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11006634351131 is a prime.
It is a super-2 number, since 2×110066343511312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11006634351091 and 11006634351100.
It is not an unprimeable number, because it can be changed into a prime (11006634351137) 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, 17970815 + ... + 18573191.
It is an arithmetic number, because the mean of its divisors is an integer number (1376665645530).
Almost surely, 211006634351131 is an apocalyptic number.
11006634351131 is a deficient number, since it is larger than the sum of its proper divisors (6690813109).
11006634351131 is an equidigital number, since it uses as much as digits as its factorization.
11006634351131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613453.
The product of its (nonzero) digits is 19440, while the sum is 35.
The spelling of 11006634351131 in words is "eleven trillion, six billion, six hundred thirty-four million, three hundred fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •