Base | Representation |
---|---|
bin | 100001001101011… |
… | …1011110110001100 |
3 | 2212122212012121101 |
4 | 1002122323312030 |
5 | 4240233412012 |
6 | 302324312444 |
7 | 36420610420 |
oct | 10232736614 |
9 | 2778765541 |
10 | 1114357132 |
11 | 522031009 |
12 | 271242724 |
13 | 149b39825 |
14 | a7dd8b80 |
15 | 67c6ed57 |
hex | 426bbd8c |
1114357132 has 48 divisors (see below), whose sum is σ = 2340092160. Its totient is φ = 454208832.
The previous prime is 1114357129. The next prime is 1114357147. The reversal of 1114357132 is 2317534111.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 1114357132.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44163 + ... + 64645.
It is an arithmetic number, because the mean of its divisors is an integer number (48751920).
Almost surely, 21114357132 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 1114357132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1170046080).
1114357132 is an abundant number, since it is smaller than the sum of its proper divisors (1225735028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1114357132 is a wasteful number, since it uses less digits than its factorization.
1114357132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20590 (or 20588 counting only the distinct ones).
The product of its digits is 2520, while the sum is 28.
The square root of 1114357132 is about 33381.9881373174. The cubic root of 1114357132 is about 1036.7518022096.
The spelling of 1114357132 in words is "one billion, one hundred fourteen million, three hundred fifty-seven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •