Base | Representation |
---|---|
bin | 100001110011000… |
… | …1011101010011000 |
3 | 2221000222101000102 |
4 | 1003212023222120 |
5 | 4310311121322 |
6 | 304311154532 |
7 | 40050354410 |
oct | 10346135230 |
9 | 2830871012 |
10 | 1134082712 |
11 | 532184144 |
12 | 277975a48 |
13 | 150c55079 |
14 | aa891640 |
15 | 69869792 |
hex | 4398ba98 |
1134082712 has 64 divisors (see below), whose sum is σ = 2554744320. Its totient is φ = 461438208.
The previous prime is 1134082709. The next prime is 1134082717. The reversal of 1134082712 is 2172804311.
It is a super-2 number, since 2×11340827122 = 2572287195314549888, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1134082717) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 173243 + ... + 179669.
It is an arithmetic number, because the mean of its divisors is an integer number (39917880).
Almost surely, 21134082712 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 1134082712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1277372160).
1134082712 is an abundant number, since it is smaller than the sum of its proper divisors (1420661608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1134082712 is a wasteful number, since it uses less digits than its factorization.
1134082712 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6600 (or 6596 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 29.
The square root of 1134082712 is about 33676.1445536748. The cubic root of 1134082712 is about 1042.8333463871.
The spelling of 1134082712 in words is "one billion, one hundred thirty-four million, eighty-two thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •