Base | Representation |
---|---|
bin | 1010000010001001110010… |
… | …0010100101111010110001 |
3 | 1110001122210011212000022211 |
4 | 2200202130202211322301 |
5 | 2421222221144030113 |
6 | 35244024451532121 |
7 | 2216020531402261 |
oct | 240423442457261 |
9 | 43048704760284 |
10 | 11032102330033 |
11 | 3573763182684 |
12 | 12a21188ba041 |
13 | 620427211705 |
14 | 2a1d56cb57a1 |
15 | 141e84b5ab3d |
hex | a089c8a5eb1 |
11032102330033 has 16 divisors (see below), whose sum is σ = 11112443965440. Its totient is φ = 10952015872000.
The previous prime is 11032102330021. The next prime is 11032102330037. The reversal of 11032102330033 is 33003320123011.
It is a cyclic number.
It is not a de Polignac number, because 11032102330033 - 25 = 11032102330001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11032102329986 and 11032102330013.
It is not an unprimeable number, because it can be changed into a prime (11032102330037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 219838641 + ... + 219888817.
It is an arithmetic number, because the mean of its divisors is an integer number (694527747840).
Almost surely, 211032102330033 is an apocalyptic number.
It is an amenable number.
11032102330033 is a deficient number, since it is larger than the sum of its proper divisors (80341635407).
11032102330033 is a wasteful number, since it uses less digits than its factorization.
11032102330033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52688.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 11032102330033 its reverse (33003320123011), we get a palindrome (44035422453044).
The spelling of 11032102330033 in words is "eleven trillion, thirty-two billion, one hundred two million, three hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •