Base | Representation |
---|---|
bin | 10000001010110010110… |
… | …110001110110001111000 |
3 | 10221012221121200001120020 |
4 | 100022302312032301320 |
5 | 121201014120420003 |
6 | 2210233330330440 |
7 | 143163101134314 |
oct | 20126266166170 |
9 | 3835847601506 |
10 | 1111102123128 |
11 | 399241200468 |
12 | 15b409a29a20 |
13 | 80a12c0a8ba |
14 | 3bac5b5cb44 |
15 | 1dd804b3d53 |
hex | 102b2d8ec78 |
1111102123128 has 32 divisors (see below), whose sum is σ = 2923952956800. Its totient is φ = 350874354528.
The previous prime is 1111102123093. The next prime is 1111102123133. The reversal of 1111102123128 is 8213212011111.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 1111102123098 and 1111102123107.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1218313276 + ... + 1218314187.
It is an arithmetic number, because the mean of its divisors is an integer number (91373529900).
Almost surely, 21111102123128 is an apocalyptic number.
It is an amenable number.
1111102123128 is an abundant number, since it is smaller than the sum of its proper divisors (1812850833672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111102123128 is a wasteful number, since it uses less digits than its factorization.
1111102123128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2436627491 (or 2436627487 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 24.
Adding to 1111102123128 its reverse (8213212011111), we get a palindrome (9324314134239).
The spelling of 1111102123128 in words is "one trillion, one hundred eleven billion, one hundred two million, one hundred twenty-three thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •