Base | Representation |
---|---|
bin | 1010010001111011010111… |
… | …0111101100110011101000 |
3 | 1111000120022012000221002012 |
4 | 2210132311313230303220 |
5 | 2440142232204431240 |
6 | 40012324355455052 |
7 | 2244423415514423 |
oct | 244366567546350 |
9 | 44016265027065 |
10 | 11303110233320 |
11 | 3668693067574 |
12 | 13267508b7488 |
13 | 63cb567217b9 |
14 | 2b11057b69ba |
15 | 149046e33b65 |
hex | a47b5decce8 |
11303110233320 has 16 divisors (see below), whose sum is σ = 25431998025060. Its totient is φ = 4521244093312.
The previous prime is 11303110233307. The next prime is 11303110233323. The reversal of 11303110233320 is 2333201130311.
It can be written as a sum of positive squares in 2 ways, for example, as 11181787590724 + 121322642596 = 3343918^2 + 348314^2 .
It is not an unprimeable number, because it can be changed into a prime (11303110233323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 141288877877 + ... + 141288877956.
Almost surely, 211303110233320 is an apocalyptic number.
11303110233320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11303110233320 is an abundant number, since it is smaller than the sum of its proper divisors (14128887791740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11303110233320 is a wasteful number, since it uses less digits than its factorization.
11303110233320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282577755844 (or 282577755840 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 11303110233320 its reverse (2333201130311), we get a palindrome (13636311363631).
The spelling of 11303110233320 in words is "eleven trillion, three hundred three billion, one hundred ten million, two hundred thirty-three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •