Base | Representation |
---|---|
bin | 10000011010011110111… |
… | …100011100110100111001 |
3 | 10222211102122022020211022 |
4 | 100122132330130310321 |
5 | 121440014202002033 |
6 | 2222101105512225 |
7 | 144330414321443 |
oct | 20323674346471 |
9 | 3884378266738 |
10 | 1127948078393 |
11 | 3a53a6314a44 |
12 | 16272b642675 |
13 | 82499017076 |
14 | 3c8431bd493 |
15 | 1e5193ad098 |
hex | 1069ef1cd39 |
1127948078393 has 2 divisors, whose sum is σ = 1127948078394. Its totient is φ = 1127948078392.
The previous prime is 1127948078339. The next prime is 1127948078417. The reversal of 1127948078393 is 3938708497211.
Together with previous prime (1127948078339) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 937395748864 + 190552329529 = 968192^2 + 436523^2 .
It is a cyclic number.
It is not a de Polignac number, because 1127948078393 - 26 = 1127948078329 is a prime.
It is a super-2 number, since 2×11279480783932 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1127948075393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 563974039196 + 563974039197.
It is an arithmetic number, because the mean of its divisors is an integer number (563974039197).
Almost surely, 21127948078393 is an apocalyptic number.
It is an amenable number.
1127948078393 is a deficient number, since it is larger than the sum of its proper divisors (1).
1127948078393 is an equidigital number, since it uses as much as digits as its factorization.
1127948078393 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18289152, while the sum is 62.
The spelling of 1127948078393 in words is "one trillion, one hundred twenty-seven billion, nine hundred forty-eight million, seventy-eight thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •