Base | Representation |
---|---|
bin | 100001001010111… |
… | …1100110000001000 |
3 | 2212120101210201112 |
4 | 1002111330300020 |
5 | 4234420100440 |
6 | 302240305452 |
7 | 36403525040 |
oct | 10225746010 |
9 | 2776353645 |
10 | 1113050120 |
11 | 521319036 |
12 | 270912288 |
13 | 14979c950 |
14 | a7b78720 |
15 | 67ab2965 |
hex | 4257cc08 |
1113050120 has 64 divisors (see below), whose sum is σ = 3082302720. Its totient is φ = 352260864.
The previous prime is 1113050093. The next prime is 1113050123. The reversal of 1113050120 is 210503111.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 1113050095 and 1113050104.
It is not an unprimeable number, because it can be changed into a prime (1113050123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 149252 + ... + 156531.
It is an arithmetic number, because the mean of its divisors is an integer number (48160980).
Almost surely, 21113050120 is an apocalyptic number.
1113050120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1113050120 is an abundant number, since it is smaller than the sum of its proper divisors (1969252600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113050120 is a wasteful number, since it uses less digits than its factorization.
1113050120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 305814 (or 305810 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 14.
The square root of 1113050120 is about 33362.4057885519. The cubic root of 1113050120 is about 1036.3463136625.
Adding to 1113050120 its reverse (210503111), we get a palindrome (1323553231).
The spelling of 1113050120 in words is "one billion, one hundred thirteen million, fifty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •