Base | Representation |
---|---|
bin | 100001001001001… |
… | …0111011110101100 |
3 | 2212111122002112001 |
4 | 1002102113132230 |
5 | 4234200023040 |
6 | 302204222044 |
7 | 36362534116 |
oct | 10222273654 |
9 | 2774562461 |
10 | 1112111020 |
11 | 520837519 |
12 | 27053a924 |
13 | 149531377 |
14 | a79b23b6 |
15 | 6797959a |
hex | 424977ac |
1112111020 has 24 divisors (see below), whose sum is σ = 2345641200. Its totient is φ = 442900032.
The previous prime is 1112111009. The next prime is 1112111023. The reversal of 1112111020 is 201112111.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 1112110988 and 1112111006.
It is not an unprimeable number, because it can be changed into a prime (1112111023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 116830 + ... + 125989.
It is an arithmetic number, because the mean of its divisors is an integer number (97735050).
Almost surely, 21112111020 is an apocalyptic number.
1112111020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1112111020 is an abundant number, since it is smaller than the sum of its proper divisors (1233530180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112111020 is a wasteful number, since it uses less digits than its factorization.
1112111020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243057 (or 243055 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
The square root of 1112111020 is about 33348.3285937991. The cubic root of 1112111020 is about 1036.0547704381.
Adding to 1112111020 its reverse (201112111), we get a palindrome (1313223131).
The spelling of 1112111020 in words is "one billion, one hundred twelve million, one hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •