Base | Representation |
---|---|
bin | 10000011110101001100… |
… | …000011001110000001011 |
3 | 11000020222022110201120212 |
4 | 100132221200121300023 |
5 | 122023144040224233 |
6 | 2224120543511335 |
7 | 144546300145550 |
oct | 20365140316013 |
9 | 4006868421525 |
10 | 1132420242443 |
11 | 3a7290782a96 |
12 | 1635792b854b |
13 | 82a2c6c5899 |
14 | 3cb49120a27 |
15 | 1e6cbceda48 |
hex | 107a9819c0b |
1132420242443 has 4 divisors (see below), whose sum is σ = 1294194562800. Its totient is φ = 970645922088.
The previous prime is 1132420242439. The next prime is 1132420242449. The reversal of 1132420242443 is 3442420242311.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1132420242443 - 22 = 1132420242439 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1132420242449) 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 3 ways as a sum of consecutive naturals, for example, 80887160168 + ... + 80887160181.
It is an arithmetic number, because the mean of its divisors is an integer number (323548640700).
Almost surely, 21132420242443 is an apocalyptic number.
1132420242443 is a deficient number, since it is larger than the sum of its proper divisors (161774320357).
1132420242443 is an equidigital number, since it uses as much as digits as its factorization.
1132420242443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161774320356.
The product of its (nonzero) digits is 36864, while the sum is 32.
Adding to 1132420242443 its reverse (3442420242311), we get a palindrome (4574840484754).
The spelling of 1132420242443 in words is "one trillion, one hundred thirty-two billion, four hundred twenty million, two hundred forty-two thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •