Base | Representation |
---|---|
bin | 10000011110100011101… |
… | …011010001110110000111 |
3 | 11000020201111102100121111 |
4 | 100132203223101312013 |
5 | 122022444020232333 |
6 | 2224103131225451 |
7 | 144544001565226 |
oct | 20364353216607 |
9 | 4006644370544 |
10 | 1132322430343 |
11 | 3a7240546345 |
12 | 1635505a8287 |
13 | 82a15369bc0 |
14 | 3cb3a13ccbd |
15 | 1e6c342c4cd |
hex | 107a3ad1d87 |
1132322430343 has 4 divisors (see below), whose sum is σ = 1219424155768. Its totient is φ = 1045220704920.
The previous prime is 1132322430331. The next prime is 1132322430367. The reversal of 1132322430343 is 3430342232311.
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 1132322430343 - 29 = 1132322429831 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132322430383) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43550862693 + ... + 43550862718.
It is an arithmetic number, because the mean of its divisors is an integer number (304856038942).
Almost surely, 21132322430343 is an apocalyptic number.
1132322430343 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1132322430343 is a deficient number, since it is larger than the sum of its proper divisors (87101725425).
1132322430343 is an equidigital number, since it uses as much as digits as its factorization.
1132322430343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87101725424.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 1132322430343 its reverse (3430342232311), we get a palindrome (4562664662654).
The spelling of 1132322430343 in words is "one trillion, one hundred thirty-two billion, three hundred twenty-two million, four hundred thirty thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •