Base | Representation |
---|---|
bin | 100001101011010… |
… | …1001100111110010 |
3 | 2220202022111211210 |
4 | 1003112221213302 |
5 | 4303240323442 |
6 | 304044020550 |
7 | 40000636032 |
oct | 10326514762 |
9 | 2822274753 |
10 | 1130011122 |
11 | 52a953099 |
12 | 276531756 |
13 | 15015aa46 |
14 | aa1118c2 |
15 | 6931319c |
hex | 435a99f2 |
1130011122 has 8 divisors (see below), whose sum is σ = 2260022256. Its totient is φ = 376670372.
The previous prime is 1130011121. The next prime is 1130011139. The reversal of 1130011122 is 2211100311.
It is a sphenic number, since it is the product of 3 distinct primes.
1130011122 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1130011098 and 1130011107.
It is not an unprimeable number, because it can be changed into a prime (1130011121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 94167588 + ... + 94167599.
It is an arithmetic number, because the mean of its divisors is an integer number (282502782).
Almost surely, 21130011122 is an apocalyptic number.
1130011122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130011122 is a wasteful number, since it uses less digits than its factorization.
1130011122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188335192.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 1130011122 is about 33615.6380573090. The cubic root of 1130011122 is about 1041.5838545395.
Adding to 1130011122 its reverse (2211100311), we get a palindrome (3341111433).
It can be divided in two parts, 11300 and 11122, that added together give a palindrome (22422).
The spelling of 1130011122 in words is "one billion, one hundred thirty million, eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •