Base | Representation |
---|---|
bin | 110011101111000100… |
… | …0101011110100110100 |
3 | 101121202211010121211100 |
4 | 1213132020223310310 |
5 | 3310013324013022 |
6 | 123012240010100 |
7 | 11012120632641 |
oct | 1473610536464 |
9 | 347684117740 |
10 | 111101001012 |
11 | 43132689501 |
12 | 19647600930 |
13 | a62763b3b1 |
14 | 553d502dc8 |
15 | 2d53aca1ac |
hex | 19de22bd34 |
111101001012 has 72 divisors (see below), whose sum is σ = 281600976384. Its totient is φ = 36933293376.
The previous prime is 111101001007. The next prime is 111101001013. The reversal of 111101001012 is 210100101111.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 111101000985 and 111101001003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111101001013) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23081118 + ... + 23085930.
It is an arithmetic number, because the mean of its divisors is an integer number (3911124672).
Almost surely, 2111101001012 is an apocalyptic number.
111101001012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111101001012 is an abundant number, since it is smaller than the sum of its proper divisors (170499975372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111101001012 is a wasteful number, since it uses less digits than its factorization.
111101001012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6429 (or 6424 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 111101001012 its reverse (210100101111), we get a palindrome (321201102123).
The spelling of 111101001012 in words is "one hundred eleven billion, one hundred one million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •