Base | Representation |
---|---|
bin | 1010000111011101100111… |
… | …1001111000110010111111 |
3 | 1110101101020201120201122022 |
4 | 2201313121321320302333 |
5 | 2424221032444110223 |
6 | 35353552511110355 |
7 | 2225430251224355 |
oct | 241673171706277 |
9 | 43341221521568 |
10 | 11123326160063 |
11 | 35a94156a6347 |
12 | 12b79375123bb |
13 | 628c0474c970 |
14 | 2a652c5477d5 |
15 | 14452367dac8 |
hex | a1dd9e78cbf |
11123326160063 has 8 divisors (see below), whose sum is σ = 11979707079648. Its totient is φ = 10267051018464.
The previous prime is 11123326160059. The next prime is 11123326160081. The reversal of 11123326160063 is 36006162332111.
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 11123326160063 - 22 = 11123326160059 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11123326160663) 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, 26226020 + ... + 26646777.
It is an arithmetic number, because the mean of its divisors is an integer number (1497463384956).
Almost surely, 211123326160063 is an apocalyptic number.
11123326160063 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11123326160063 is a deficient number, since it is larger than the sum of its proper divisors (856380919585).
11123326160063 is a wasteful number, since it uses less digits than its factorization.
11123326160063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52888993.
The product of its (nonzero) digits is 23328, while the sum is 35.
Adding to 11123326160063 its reverse (36006162332111), we get a palindrome (47129488492174).
The spelling of 11123326160063 in words is "eleven trillion, one hundred twenty-three billion, three hundred twenty-six million, one hundred sixty thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •