Base | Representation |
---|---|
bin | 10000100100101010001… |
… | …100011100111000100101 |
3 | 11000212122002210210120202 |
4 | 100210222030130320211 |
5 | 122124403301144144 |
6 | 2231105215240245 |
7 | 145165236214553 |
oct | 20445214347045 |
9 | 4025562723522 |
10 | 1138874240549 |
11 | 3a9aa2900321 |
12 | 16487a819085 |
13 | 8351a85b086 |
14 | 3d19c34cbd3 |
15 | 1e95871464e |
hex | 1092a31ce25 |
1138874240549 has 2 divisors, whose sum is σ = 1138874240550. Its totient is φ = 1138874240548.
The previous prime is 1138874240513. The next prime is 1138874240563. The reversal of 1138874240549 is 9450424788311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 854792702500 + 284081538049 = 924550^2 + 532993^2 .
It is a cyclic number.
It is not a de Polignac number, because 1138874240549 - 216 = 1138874175013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1138874240494 and 1138874240503.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1138874245549) 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 as a sum of consecutive naturals, namely, 569437120274 + 569437120275.
It is an arithmetic number, because the mean of its divisors is an integer number (569437120275).
Almost surely, 21138874240549 is an apocalyptic number.
It is an amenable number.
1138874240549 is a deficient number, since it is larger than the sum of its proper divisors (1).
1138874240549 is an equidigital number, since it uses as much as digits as its factorization.
1138874240549 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7741440, while the sum is 56.
The spelling of 1138874240549 in words is "one trillion, one hundred thirty-eight billion, eight hundred seventy-four million, two hundred forty thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •