Base | Representation |
---|---|
bin | 1010011110110111001101… |
… | …1001100000000101011110 |
3 | 1111210210220021222101111011 |
4 | 2213231303121200011132 |
5 | 3002312340312220110 |
6 | 40302355351445434 |
7 | 2266451334550615 |
oct | 247556331400536 |
9 | 44723807871434 |
10 | 11525333320030 |
11 | 3743959215732 |
12 | 136182a98687a |
13 | 657aacb7130a |
14 | 2bbb8710a87c |
15 | 14ec013a148a |
hex | a7b7366015e |
11525333320030 has 8 divisors (see below), whose sum is σ = 20745599976072. Its totient is φ = 4610133328008.
The previous prime is 11525333320021. The next prime is 11525333320087. The reversal of 11525333320030 is 3002333352511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11525333319974 and 11525333320001.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 576266665992 + ... + 576266666011.
It is an arithmetic number, because the mean of its divisors is an integer number (2593199997009).
Almost surely, 211525333320030 is an apocalyptic number.
11525333320030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11525333320030 is a deficient number, since it is larger than the sum of its proper divisors (9220266656042).
11525333320030 is a wasteful number, since it uses less digits than its factorization.
11525333320030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1152533332010.
The product of its (nonzero) digits is 24300, while the sum is 31.
Adding to 11525333320030 its reverse (3002333352511), we get a palindrome (14527666672541).
The spelling of 11525333320030 in words is "eleven trillion, five hundred twenty-five billion, three hundred thirty-three million, three hundred twenty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •