Base | Representation |
---|---|
bin | 11001001111010001101111… |
… | …001111000010001110110110 |
3 | 112120000120222121112210022100 |
4 | 121033101233033002032312 |
5 | 104022120022224310402 |
6 | 1032025053401242530 |
7 | 32244362165644440 |
oct | 3117215717021666 |
9 | 476016877483270 |
10 | 111001001010102 |
11 | 32406295309865 |
12 | 105488a2793446 |
13 | 49c2470a6bb68 |
14 | 1d5a6972b9490 |
15 | cc75cdca971c |
hex | 64f46f3c23b6 |
111001001010102 has 96 divisors (see below), whose sum is σ = 275564336433984. Its totient is φ = 31633265664000.
The previous prime is 111001001010037. The next prime is 111001001010209. The reversal of 111001001010102 is 201010100100111.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
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, 1680756202 + ... + 1680822242.
It is an arithmetic number, because the mean of its divisors is an integer number (2870461837854).
Almost surely, 2111001001010102 is an apocalyptic number.
111001001010102 is an abundant number, since it is smaller than the sum of its proper divisors (164563335423882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111001001010102 is a wasteful number, since it uses less digits than its factorization.
111001001010102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100054 (or 100051 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 111001001010102 its reverse (201010100100111), we get a palindrome (312011101110213).
Subtracting 111001001010102 from its reverse (201010100100111), we obtain a palindrome (90009099090009).
The spelling of 111001001010102 in words is "one hundred eleven trillion, one billion, one million, ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •