Base | Representation |
---|---|
bin | 100001001110010… |
… | …0000000000001000 |
3 | 2212200122001100022 |
4 | 1002130200000020 |
5 | 4240340023433 |
6 | 302341200012 |
7 | 36424236431 |
oct | 10234400010 |
9 | 2780561308 |
10 | 1114767368 |
11 | 522291250 |
12 | 271400008 |
13 | 149c51480 |
14 | a80a4488 |
15 | 67d01698 |
hex | 42720008 |
1114767368 has 64 divisors (see below), whose sum is σ = 2515605120. Its totient is φ = 456307200.
The previous prime is 1114767331. The next prime is 1114767377. The reversal of 1114767368 is 8637674111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35021 + ... + 58787.
It is an arithmetic number, because the mean of its divisors is an integer number (39306330).
Almost surely, 21114767368 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 1114767368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1257802560).
1114767368 is an abundant number, since it is smaller than the sum of its proper divisors (1400837752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1114767368 is a wasteful number, since it uses less digits than its factorization.
1114767368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23838 (or 23834 counting only the distinct ones).
The product of its digits is 169344, while the sum is 44.
The square root of 1114767368 is about 33388.1321430235. The cubic root of 1114767368 is about 1036.8790088054.
The spelling of 1114767368 in words is "one billion, one hundred fourteen million, seven hundred sixty-seven thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •