Base | Representation |
---|---|
bin | 10000011110100100101… |
… | …111111000010001110001 |
3 | 11000020202202020222221022 |
4 | 100132210233320101301 |
5 | 122023013121213203 |
6 | 2224105012505225 |
7 | 144544310464346 |
oct | 20364457702161 |
9 | 4006682228838 |
10 | 1132340413553 |
11 | 3a724a7093a8 |
12 | 16355661b215 |
13 | 82a18cc535b |
14 | 3cb3c6a07cd |
15 | 1e6c4cd0a38 |
hex | 107a4bf8471 |
1132340413553 has 4 divisors (see below), whose sum is σ = 1171386634740. Its totient is φ = 1093294192368.
The previous prime is 1132340413507. The next prime is 1132340413571. The reversal of 1132340413553 is 3553140432311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 743004348529 + 389336065024 = 861977^2 + 623968^2 .
It is a cyclic number.
It is not a de Polignac number, because 1132340413553 - 228 = 1132071978097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1132340413573) 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, 19523110550 + ... + 19523110607.
It is an arithmetic number, because the mean of its divisors is an integer number (292846658685).
Almost surely, 21132340413553 is an apocalyptic number.
It is an amenable number.
1132340413553 is a deficient number, since it is larger than the sum of its proper divisors (39046221187).
1132340413553 is an equidigital number, since it uses as much as digits as its factorization.
1132340413553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39046221186.
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 1132340413553 its reverse (3553140432311), we get a palindrome (4685480845864).
The spelling of 1132340413553 in words is "one trillion, one hundred thirty-two billion, three hundred forty million, four hundred thirteen thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •