Base | Representation |
---|---|
bin | 1010010011100111000110… |
… | …1000101110111001101001 |
3 | 1111010022221200002222120211 |
4 | 2210321301220232321221 |
5 | 2441130444214330441 |
6 | 40033510211421121 |
7 | 2246466162444046 |
oct | 244716150567151 |
9 | 44108850088524 |
10 | 11332030230121 |
11 | 3679983704177 |
12 | 1330281bb47a1 |
13 | 6427b5117a43 |
14 | 2b268a60a1cd |
15 | 149b8ad26a81 |
hex | a4e71a2ee69 |
11332030230121 has 16 divisors (see below), whose sum is σ = 12186769351680. Its totient is φ = 10511088310800.
The previous prime is 11332030230083. The next prime is 11332030230133. The reversal of 11332030230121 is 12103203023311.
It is not a de Polignac number, because 11332030230121 - 29 = 11332030229609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11332030230092 and 11332030230101.
It is not an unprimeable number, because it can be changed into a prime (11332030230821) 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 15 ways as a sum of consecutive naturals, for example, 41078605 + ... + 41353546.
It is an arithmetic number, because the mean of its divisors is an integer number (761673084480).
Almost surely, 211332030230121 is an apocalyptic number.
It is an amenable number.
11332030230121 is a deficient number, since it is larger than the sum of its proper divisors (854739121559).
11332030230121 is a wasteful number, since it uses less digits than its factorization.
11332030230121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82432356.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 11332030230121 its reverse (12103203023311), we get a palindrome (23435233253432).
The spelling of 11332030230121 in words is "eleven trillion, three hundred thirty-two billion, thirty million, two hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •