Base | Representation |
---|---|
bin | 1010001011111111011000… |
… | …1111111011101010001010 |
3 | 1110122211000200200201101100 |
4 | 2202333312033323222022 |
5 | 2432004333421043310 |
6 | 35453415220402230 |
7 | 2234152655345016 |
oct | 242776617735212 |
9 | 43584020621340 |
10 | 11201111112330 |
11 | 3629401235267 |
12 | 130aa25546376 |
13 | 63334c9b4b39 |
14 | 2aa1cb049546 |
15 | 14657745bec0 |
hex | a2ff63fba8a |
11201111112330 has 96 divisors (see below), whose sum is σ = 30128230875600. Its totient is φ = 2883858518016.
The previous prime is 11201111112329. The next prime is 11201111112397. The reversal of 11201111112330 is 3321111110211.
11201111112330 is a `hidden beast` number, since 11 + 201 + 1 + 11 + 112 + 330 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 8453147481 + 11192657964849 = 91941^2 + 3345543^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 91594266 + ... + 91716474.
Almost surely, 211201111112330 is an apocalyptic number.
11201111112330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11201111112330 is an abundant number, since it is smaller than the sum of its proper divisors (18927119763270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11201111112330 is a wasteful number, since it uses less digits than its factorization.
11201111112330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157368 (or 157365 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 11201111112330 its reverse (3321111110211), we get a palindrome (14522222222541).
The spelling of 11201111112330 in words is "eleven trillion, two hundred one billion, one hundred eleven million, one hundred twelve thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •