Base | Representation |
---|---|
bin | 100001001100110… |
… | …0111010111011000 |
3 | 2212122012121221020 |
4 | 1002121213113120 |
5 | 4240141323341 |
6 | 302313042440 |
7 | 36414636522 |
oct | 10231472730 |
9 | 2778177836 |
10 | 1114011096 |
11 | 521915030 |
12 | 2710b6420 |
13 | 149a48183 |
14 | a7d48a12 |
15 | 67c02566 |
hex | 426675d8 |
1114011096 has 128 divisors (see below), whose sum is σ = 3174854400. Its totient is φ = 322721280.
The previous prime is 1114011083. The next prime is 1114011103. The reversal of 1114011096 is 6901104111.
It is a super-2 number, since 2×11140110962 = 2482041444022242432, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 575346 + ... + 577278.
It is an arithmetic number, because the mean of its divisors is an integer number (24803550).
Almost surely, 21114011096 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1114011096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1587427200).
1114011096 is an abundant number, since it is smaller than the sum of its proper divisors (2060843304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1114011096 is a wasteful number, since it uses less digits than its factorization.
1114011096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2049 (or 2045 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 24.
The square root of 1114011096 is about 33376.8047601924. The cubic root of 1114011096 is about 1036.6444785708.
The spelling of 1114011096 in words is "one billion, one hundred fourteen million, eleven thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •