Base | Representation |
---|---|
bin | 1010000110110100100111… |
… | …1101010011011101010010 |
3 | 1110100022211202210221020000 |
4 | 2201231021331103131102 |
5 | 2424031013211431002 |
6 | 35344532504430430 |
7 | 2224560451511466 |
oct | 241551175233522 |
9 | 43308752727200 |
10 | 11112321202002 |
11 | 35a4788691489 |
12 | 12b5785a78416 |
13 | 627b6c7aa667 |
14 | 2a5ba6b464a6 |
15 | 1440cc46061c |
hex | a1b49f53752 |
11112321202002 has 40 divisors (see below), whose sum is σ = 24902251805772. Its totient is φ = 3703746924000.
The previous prime is 11112321201991. The next prime is 11112321202033. The reversal of 11112321202002 is 20020212321111.
11112321202002 is a `hidden beast` number, since 1 + 111 + 232 + 120 + 200 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 10428837055641 + 683484146361 = 3229371^2 + 826731^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 pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1660749 + ... + 4998272.
Almost surely, 211112321202002 is an apocalyptic number.
11112321202002 is an abundant number, since it is smaller than the sum of its proper divisors (13789930603770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112321202002 is a wasteful number, since it uses less digits than its factorization.
11112321202002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6669336 (or 6669327 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 11112321202002 its reverse (20020212321111), we get a palindrome (31132533523113).
The spelling of 11112321202002 in words is "eleven trillion, one hundred twelve billion, three hundred twenty-one million, two hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •