Base | Representation |
---|---|
bin | 10000011100110011011… |
… | …111010011011101010011 |
3 | 11000001212022202100000011 |
4 | 100130303133103131103 |
5 | 122010120200234102 |
6 | 2223152253335351 |
7 | 144446235344524 |
oct | 20346337233523 |
9 | 4001768670004 |
10 | 1130440243027 |
11 | 3a6465057137 |
12 | 163106197557 |
13 | 827a5431cb4 |
14 | 3c9dc19084b |
15 | 1e61308c2d7 |
hex | 107337d3753 |
1130440243027 has 2 divisors, whose sum is σ = 1130440243028. Its totient is φ = 1130440243026.
The previous prime is 1130440243007. The next prime is 1130440243039. The reversal of 1130440243027 is 7203420440311.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1130440243027 is a prime.
It is a super-3 number, since 3×11304402430273 (a number of 37 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1130440243027.
It is not a weakly prime, because it can be changed into another prime (1130440243007) 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, 565220121513 + 565220121514.
It is an arithmetic number, because the mean of its divisors is an integer number (565220121514).
Almost surely, 21130440243027 is an apocalyptic number.
1130440243027 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130440243027 is an equidigital number, since it uses as much as digits as its factorization.
1130440243027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 31.
Adding to 1130440243027 its reverse (7203420440311), we get a palindrome (8333860683338).
The spelling of 1130440243027 in words is "one trillion, one hundred thirty billion, four hundred forty million, two hundred forty-three thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •