Base | Representation |
---|---|
bin | 110011101111010111… |
… | …0110101001110101010 |
3 | 101121210111221200020100 |
4 | 1213132232311032222 |
5 | 3310023404013002 |
6 | 123013234210230 |
7 | 11012301632301 |
oct | 1473656651652 |
9 | 347714850210 |
10 | 111111001002 |
11 | 43138299661 |
12 | 1964aa23976 |
13 | a62972cc51 |
14 | 5540987438 |
15 | 2d5490311c |
hex | 19debb53aa |
111111001002 has 12 divisors (see below), whose sum is σ = 240740502210. Its totient is φ = 37037000328.
The previous prime is 111111000991. The next prime is 111111001003. The reversal of 111111001002 is 200100111111.
It can be written as a sum of positive squares in only one way, i.e., 101099197521 + 10011803481 = 317961^2 + 100059^2 .
It is a super-4 number, since 4×1111110010024 (a number of 45 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (111111001003) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 3086416677 + ... + 3086416712.
Almost surely, 2111111001002 is an apocalyptic number.
111111001002 is an abundant number, since it is smaller than the sum of its proper divisors (129629501208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111111001002 is a wasteful number, since it uses less digits than its factorization.
111111001002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6172833397 (or 6172833394 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 111111001002 its reverse (200100111111), we get a palindrome (311211112113).
The spelling of 111111001002 in words is "one hundred eleven billion, one hundred eleven million, one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •