Base | Representation |
---|---|
bin | 100001101111111… |
… | …0010001011001011 |
3 | 2220220211011020122 |
4 | 1003133302023023 |
5 | 4304343433301 |
6 | 304211213455 |
7 | 40030200422 |
oct | 10337621313 |
9 | 2826734218 |
10 | 1132405451 |
11 | 531238a81 |
12 | 2772a728b |
13 | 1507b87c8 |
14 | aa5762b9 |
15 | 6963781b |
hex | 437f22cb |
1132405451 has 8 divisors (see below), whose sum is σ = 1168426560. Its totient is φ = 1096881408.
The previous prime is 1132405441. The next prime is 1132405459. The reversal of 1132405451 is 1545042311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1132405451 - 218 = 1132143307 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1132405451.
It is not an unprimeable number, because it can be changed into a prime (1132405459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119636 + ... + 128753.
It is an arithmetic number, because the mean of its divisors is an integer number (146053320).
Almost surely, 21132405451 is an apocalyptic number.
1132405451 is a deficient number, since it is larger than the sum of its proper divisors (36021109).
1132405451 is an equidigital number, since it uses as much as digits as its factorization.
1132405451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248533.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 1132405451 is about 33651.2325331480. The cubic root of 1132405451 is about 1042.3189904012.
Adding to 1132405451 its reverse (1545042311), we get a palindrome (2677447762).
The spelling of 1132405451 in words is "one billion, one hundred thirty-two million, four hundred five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •