Base | Representation |
---|---|
bin | 1010000010001101111111… |
… | …0100111000111100100001 |
3 | 1110001202200212000112211211 |
4 | 2200203133310320330201 |
5 | 2421232024141400113 |
6 | 35244332455310121 |
7 | 2216060516546410 |
oct | 240433764707441 |
9 | 43052625015754 |
10 | 11033231200033 |
11 | 3574192416399 |
12 | 12a239297b341 |
13 | 62057705cc23 |
14 | 2a2022bab477 |
15 | 141eedce5b3d |
hex | a08dfd38f21 |
11033231200033 has 32 divisors (see below), whose sum is σ = 13090993977600. Its totient is φ = 9098214994176.
The previous prime is 11033231199973. The next prime is 11033231200037. The reversal of 11033231200033 is 33000213233011.
11033231200033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-11033231200033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11033231199977 and 11033231200013.
It is not an unprimeable number, because it can be changed into a prime (11033231200037) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 451373910 + ... + 451398352.
It is an arithmetic number, because the mean of its divisors is an integer number (409093561800).
Almost surely, 211033231200033 is an apocalyptic number.
It is an amenable number.
11033231200033 is a deficient number, since it is larger than the sum of its proper divisors (2057762777567).
11033231200033 is a wasteful number, since it uses less digits than its factorization.
11033231200033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32361.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 11033231200033 its reverse (33000213233011), we get a palindrome (44033444433044).
The spelling of 11033231200033 in words is "eleven trillion, thirty-three billion, two hundred thirty-one million, two hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •