Base | Representation |
---|---|
bin | 100001101111110… |
… | …0010110000110001 |
3 | 2220220200221122111 |
4 | 1003133202300301 |
5 | 4304334423241 |
6 | 304210005321 |
7 | 40026515365 |
oct | 10337426061 |
9 | 2826627574 |
10 | 1132342321 |
11 | 5311a5600 |
12 | 277276841 |
13 | 150795b56 |
14 | aa55b2a5 |
15 | 69623c81 |
hex | 437e2c31 |
1132342321 has 6 divisors (see below), whose sum is σ = 1244640866. Its totient is φ = 1029402000.
The previous prime is 1132342243. The next prime is 1132342397. The reversal of 1132342321 is 1232432311.
It can be written as a sum of positive squares in only one way, i.e., 881436721 + 250905600 = 29689^2 + 15840^2 .
It is not a de Polignac number, because 1132342321 - 27 = 1132342193 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1132342292 and 1132342301.
It is not an unprimeable number, because it can be changed into a prime (1132346321) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4678980 + ... + 4679221.
Almost surely, 21132342321 is an apocalyptic number.
1132342321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1132342321 is a deficient number, since it is larger than the sum of its proper divisors (112298545).
1132342321 is an equidigital number, since it uses as much as digits as its factorization.
1132342321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9358223 (or 9358212 counting only the distinct ones).
The product of its digits is 864, while the sum is 22.
The square root of 1132342321 is about 33650.2945157988. The cubic root of 1132342321 is about 1042.2996207721.
Adding to 1132342321 its reverse (1232432311), we get a palindrome (2364774632).
The spelling of 1132342321 in words is "one billion, one hundred thirty-two million, three hundred forty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •