Base | Representation |
---|---|
bin | 100001001011000… |
… | …1110000100000110 |
3 | 2212120112101222211 |
4 | 1002112032010012 |
5 | 4234424333110 |
6 | 302242014034 |
7 | 36404241550 |
oct | 10226160406 |
9 | 2776471884 |
10 | 1113121030 |
11 | 52136733a |
12 | 27094731a |
13 | 1497c5cc8 |
14 | a7b964d0 |
15 | 67ac898a |
hex | 4258e106 |
1113121030 has 32 divisors (see below), whose sum is σ = 2363719680. Its totient is φ = 369329760.
The previous prime is 1113121021. The next prime is 1113121033. The reversal of 1113121030 is 301213111.
It is a self number, because there is not a number n which added to its sum of digits gives 1113121030.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113121033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 254310 + ... + 258649.
It is an arithmetic number, because the mean of its divisors is an integer number (73866240).
Almost surely, 21113121030 is an apocalyptic number.
1113121030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1113121030 is an abundant number, since it is smaller than the sum of its proper divisors (1250598650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113121030 is a wasteful number, since it uses less digits than its factorization.
1113121030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 513004.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1113121030 is about 33363.4684947474. The cubic root of 1113121030 is about 1036.3683209844.
Adding to 1113121030 its reverse (301213111), we get a palindrome (1414334141).
The spelling of 1113121030 in words is "one billion, one hundred thirteen million, one hundred twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •