Base | Representation |
---|---|
bin | 100001000111100… |
… | …0101000001100100 |
3 | 2212110000022001020 |
4 | 1002033011001210 |
5 | 4233434431441 |
6 | 302133531140 |
7 | 36352313664 |
oct | 10217050144 |
9 | 2773008036 |
10 | 1111248996 |
11 | 5202a8900 |
12 | 2701a3ab0 |
13 | 1492bbbb0 |
14 | a782a1a4 |
15 | 67858e66 |
hex | 423c5064 |
1111248996 has 144 divisors (see below), whose sum is σ = 3250783872. Its totient is φ = 292469760.
The previous prime is 1111248973. The next prime is 1111249021. The reversal of 1111248996 is 6998421111.
It is a super-2 number, since 2×11112489962 = 2469748662222016032, which contains 22 as substring.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 319161 + ... + 322623.
It is an arithmetic number, because the mean of its divisors is an integer number (22574888).
Almost surely, 21111248996 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 1111248996, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1625391936).
1111248996 is an abundant number, since it is smaller than the sum of its proper divisors (2139534876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111248996 is a wasteful number, since it uses less digits than its factorization.
1111248996 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3522 (or 3509 counting only the distinct ones).
The product of its digits is 31104, while the sum is 42.
The square root of 1111248996 is about 33335.4015425043. The cubic root of 1111248996 is about 1035.7870109200.
The spelling of 1111248996 in words is "one billion, one hundred eleven million, two hundred forty-eight thousand, nine hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •