Base | Representation |
---|---|
bin | 100001011010101… |
… | …1110000101101100 |
3 | 2220010221121110000 |
4 | 1002311132011230 |
5 | 4244024010012 |
6 | 303133344300 |
7 | 36534001332 |
oct | 10265360554 |
9 | 2803847400 |
10 | 1121313132 |
11 | 525a52175 |
12 | 273638090 |
13 | 14b4039c4 |
14 | a8cc9b52 |
15 | 68695ddc |
hex | 42d5e16c |
1121313132 has 60 divisors (see below), whose sum is σ = 3103780680. Its totient is φ = 351782784.
The previous prime is 1121313119. The next prime is 1121313161. The reversal of 1121313132 is 2313131211.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a nude number because it is divisible by every one of its digits and also a Zuckerman number because it is divisible by the product of its digits.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 96282 + ... + 107297.
It is an arithmetic number, because the mean of its divisors is an integer number (51729678).
Almost surely, 21121313132 is an apocalyptic number.
1121313132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1121313132 is an abundant number, since it is smaller than the sum of its proper divisors (1982467548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121313132 is a wasteful number, since it uses less digits than its factorization.
1121313132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203612 (or 203601 counting only the distinct ones).
The product of its digits is 108, while the sum is 18.
The square root of 1121313132 is about 33486.0139759870. The cubic root of 1121313132 is about 1038.9045207969.
Adding to 1121313132 its reverse (2313131211), we get a palindrome (3434444343).
The spelling of 1121313132 in words is "one billion, one hundred twenty-one million, three hundred thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •