Base | Representation |
---|---|
bin | 1010010011101011100010… |
… | …0011011110011001000001 |
3 | 1111010110000120221021211100 |
4 | 2210322320203132121001 |
5 | 2441140413312042423 |
6 | 40034224233205013 |
7 | 2246540520555255 |
oct | 244727043363101 |
9 | 44113016837740 |
10 | 11333220034113 |
11 | 367a43428655a |
12 | 1330554560769 |
13 | 64294477c383 |
14 | 2b2760644265 |
15 | 149c0a4eb343 |
hex | a4eb88de641 |
11333220034113 has 6 divisors (see below), whose sum is σ = 16370206715954. Its totient is φ = 7555480022736.
The previous prime is 11333220034067. The next prime is 11333220034121. The reversal of 11333220034113 is 31143002233311.
11333220034113 is a `hidden beast` number, since 1 + 13 + 3 + 32 + 200 + 3 + 411 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 7376096514609 + 3957123519504 = 2715897^2 + 1989252^2 .
It is not a de Polignac number, because 11333220034113 - 28 = 11333220033857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11333220030113) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 629623335220 + ... + 629623335237.
Almost surely, 211333220034113 is an apocalyptic number.
It is an amenable number.
11333220034113 is a deficient number, since it is larger than the sum of its proper divisors (5036986681841).
11333220034113 is a wasteful number, since it uses less digits than its factorization.
11333220034113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1259246670463 (or 1259246670460 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
Adding to 11333220034113 its reverse (31143002233311), we get a palindrome (42476222267424).
The spelling of 11333220034113 in words is "eleven trillion, three hundred thirty-three billion, two hundred twenty million, thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •