Base | Representation |
---|---|
bin | 1010000010001010100001… |
… | …0100110000100101111010 |
3 | 1110001200021221212020011001 |
4 | 2200202220110300211322 |
5 | 2421223122301432310 |
6 | 35244100233155214 |
7 | 2216025452001055 |
oct | 240425024604572 |
9 | 43050257766131 |
10 | 11032300030330 |
11 | 3573854834857 |
12 | 12a2172b5bb0a |
13 | 620459172037 |
14 | 2a1d75259a9c |
15 | 141e971ad93a |
hex | a08a853097a |
11032300030330 has 32 divisors (see below), whose sum is σ = 21281579017344. Its totient is φ = 4106971382976.
The previous prime is 11032300030319. The next prime is 11032300030373. The reversal of 11032300030330 is 3303000323011.
It is a junction number, because it is equal to n+sod(n) for n = 11032300030298 and 11032300030307.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 648187732 + ... + 648204751.
It is an arithmetic number, because the mean of its divisors is an integer number (665049344292).
Almost surely, 211032300030330 is an apocalyptic number.
11032300030330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11032300030330 is a deficient number, since it is larger than the sum of its proper divisors (10249278987014).
11032300030330 is a wasteful number, since it uses less digits than its factorization.
11032300030330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1296392550.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 11032300030330 its reverse (3303000323011), we get a palindrome (14335300353341).
The spelling of 11032300030330 in words is "eleven trillion, thirty-two billion, three hundred million, thirty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •