Base | Representation |
---|---|
bin | 1010010011100011101101… |
… | …1100011000010101111010 |
3 | 1111010020121022021102222012 |
4 | 2210320323130120111322 |
5 | 2441122113440203310 |
6 | 40033240052125522 |
7 | 2246434512345344 |
oct | 244707334302572 |
9 | 44106538242865 |
10 | 11331121022330 |
11 | 367955746297a |
12 | 13300696068a2 |
13 | 64269b949275 |
14 | 2b2601974294 |
15 | 149b360cbc05 |
hex | a4e3b71857a |
11331121022330 has 16 divisors (see below), whose sum is σ = 20396059963560. Its totient is φ = 4532439048192.
The previous prime is 11331121022311. The next prime is 11331121022339. The reversal of 11331121022330 is 3322012113311.
It can be written as a sum of positive squares in 4 ways, for example, as 7197206583121 + 4133914439209 = 2682761^2 + 2033203^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11331121022296 and 11331121022305.
It is not an unprimeable number, because it can be changed into a prime (11331121022339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6014942 + ... + 7670838.
Almost surely, 211331121022330 is an apocalyptic number.
11331121022330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11331121022330 is a deficient number, since it is larger than the sum of its proper divisors (9064938941230).
11331121022330 is a wasteful number, since it uses less digits than its factorization.
11331121022330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2340193.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11331121022330 its reverse (3322012113311), we get a palindrome (14653133135641).
The spelling of 11331121022330 in words is "eleven trillion, three hundred thirty-one billion, one hundred twenty-one million, twenty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •