Base | Representation |
---|---|
bin | 1010010001110001110011… |
… | …0011101000010011001001 |
3 | 1111000022200012220222021120 |
4 | 2210130130303220103021 |
5 | 2440122002304032413 |
6 | 40011221503025453 |
7 | 2244302654161203 |
oct | 244343463502311 |
9 | 44008605828246 |
10 | 11300542252233 |
11 | 3667595551353 |
12 | 132615489b289 |
13 | 63c8376ac770 |
14 | 2b0d4070b773 |
15 | 148e4677a723 |
hex | a471cce84c9 |
11300542252233 has 16 divisors (see below), whose sum is σ = 16236895147200. Its totient is φ = 6949690346304.
The previous prime is 11300542252229. The next prime is 11300542252249. The reversal of 11300542252233 is 33225224500311.
It is not a de Polignac number, because 11300542252233 - 22 = 11300542252229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11300542252194 and 11300542252203.
It is not an unprimeable number, because it can be changed into a prime (11300542252033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 93470091 + ... + 93590912.
It is an arithmetic number, because the mean of its divisors is an integer number (1014805946700).
Almost surely, 211300542252233 is an apocalyptic number.
11300542252233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11300542252233 is a deficient number, since it is larger than the sum of its proper divisors (4936352894967).
11300542252233 is a wasteful number, since it uses less digits than its factorization.
11300542252233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187062568.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 11300542252233 its reverse (33225224500311), we get a palindrome (44525766752544).
The spelling of 11300542252233 in words is "eleven trillion, three hundred billion, five hundred forty-two million, two hundred fifty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •