Base | Representation |
---|---|
bin | 10000011110111100110… |
… | …100110001011100111101 |
3 | 11000021210220100001212222 |
4 | 100132330310301130331 |
5 | 122024330023141001 |
6 | 2224213042335125 |
7 | 144560314051232 |
oct | 20367464613475 |
9 | 4007726301788 |
10 | 1132744349501 |
11 | 3a7437722466 |
12 | 16364995a4a5 |
13 | 82a818b42cb |
14 | 3cb7a1ab789 |
15 | 1e6ea4c061b |
hex | 107bcd3173d |
1132744349501 has 2 divisors, whose sum is σ = 1132744349502. Its totient is φ = 1132744349500.
The previous prime is 1132744349497. The next prime is 1132744349533. The reversal of 1132744349501 is 1059434472311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 621733827001 + 511010522500 = 788501^2 + 714850^2 .
It is a cyclic number.
It is not a de Polignac number, because 1132744349501 - 22 = 1132744349497 is a prime.
It is a super-2 number, since 2×11327443495012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1132744349201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566372174750 + 566372174751.
It is an arithmetic number, because the mean of its divisors is an integer number (566372174751).
Almost surely, 21132744349501 is an apocalyptic number.
It is an amenable number.
1132744349501 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132744349501 is an equidigital number, since it uses as much as digits as its factorization.
1132744349501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 44.
The spelling of 1132744349501 in words is "one trillion, one hundred thirty-two billion, seven hundred forty-four million, three hundred forty-nine thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •