Base | Representation |
---|---|
bin | 1010000110101101000110… |
… | …0100000010010010000101 |
3 | 1110100010122000000220020010 |
4 | 2201223101210002102011 |
5 | 2424012344113442013 |
6 | 35344000231300433 |
7 | 2224456423646652 |
oct | 241532144022205 |
9 | 43303560026203 |
10 | 11110301312133 |
11 | 35a394149a311 |
12 | 12b530151a719 |
13 | 62790a18b05a |
14 | 2a5a54790c29 |
15 | 14400ee6e7c3 |
hex | a1ad1902485 |
11110301312133 has 8 divisors (see below), whose sum is σ = 14813849233600. Its totient is φ = 7406810466048.
The previous prime is 11110301312069. The next prime is 11110301312161. The reversal of 11110301312133 is 33121310301111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11110301312133 - 26 = 11110301312069 is a prime.
It is a super-2 number, since 2×111103013121332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110301312333) 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, 13812553 + ... + 14594766.
It is an arithmetic number, because the mean of its divisors is an integer number (1851731154200).
Almost surely, 211110301312133 is an apocalyptic number.
It is an amenable number.
11110301312133 is a deficient number, since it is larger than the sum of its proper divisors (3703547921467).
11110301312133 is a wasteful number, since it uses less digits than its factorization.
11110301312133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28537691.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 11110301312133 its reverse (33121310301111), we get a palindrome (44231611613244).
The spelling of 11110301312133 in words is "eleven trillion, one hundred ten billion, three hundred one million, three hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •