Base | Representation |
---|---|
bin | 10100101101100111… |
… | …11110010000010010 |
3 | 1001200222111201011022 |
4 | 22112303332100102 |
5 | 140233224010310 |
6 | 5035235115442 |
7 | 542365433054 |
oct | 122663762022 |
9 | 31628451138 |
10 | 11120141330 |
11 | 4797036851 |
12 | 21a4142b82 |
13 | 1082aa09ac |
14 | 776c258d4 |
15 | 4513c1a55 |
hex | 296cfe412 |
11120141330 has 8 divisors (see below), whose sum is σ = 20016254412. Its totient is φ = 4448056528.
The previous prime is 11120141323. The next prime is 11120141341. The reversal of 11120141330 is 3314102111.
11120141330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 10739384161 + 380757169 = 103631^2 + 19513^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11120141299 and 11120141308.
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 3 ways as a sum of consecutive naturals, for example, 556007057 + ... + 556007076.
Almost surely, 211120141330 is an apocalyptic number.
11120141330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11120141330 is a deficient number, since it is larger than the sum of its proper divisors (8896113082).
11120141330 is a wasteful number, since it uses less digits than its factorization.
11120141330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112014140.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11120141330 its reverse (3314102111), we get a palindrome (14434243441).
The spelling of 11120141330 in words is "eleven billion, one hundred twenty million, one hundred forty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •