Base | Representation |
---|---|
bin | 10000100101000101110… |
… | …010100110111100010001 |
3 | 11000220211101000000000221 |
4 | 100211011302212330101 |
5 | 122131330312244144 |
6 | 2231223154513041 |
7 | 145212560435416 |
oct | 20450562467421 |
9 | 4026741000027 |
10 | 1139337228049 |
11 | 3aa210187719 |
12 | 164989895781 |
13 | 83592754387 |
14 | 3d203a2c10d |
15 | 1e9841bad84 |
hex | 10945ca6f11 |
1139337228049 has 2 divisors, whose sum is σ = 1139337228050. Its totient is φ = 1139337228048.
The previous prime is 1139337228047. The next prime is 1139337228077. The reversal of 1139337228049 is 9408227339311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 757932171649 + 381405056400 = 870593^2 + 617580^2 .
It is an emirp because it is prime and its reverse (9408227339311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1139337228049 - 21 = 1139337228047 is a prime.
Together with 1139337228047, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1139337227987 and 1139337228005.
It is not a weakly prime, because it can be changed into another prime (1139337228047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 569668614024 + 569668614025.
It is an arithmetic number, because the mean of its divisors is an integer number (569668614025).
Almost surely, 21139337228049 is an apocalyptic number.
It is an amenable number.
1139337228049 is a deficient number, since it is larger than the sum of its proper divisors (1).
1139337228049 is an equidigital number, since it uses as much as digits as its factorization.
1139337228049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1959552, while the sum is 52.
The spelling of 1139337228049 in words is "one trillion, one hundred thirty-nine billion, three hundred thirty-seven million, two hundred twenty-eight thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •