Base | Representation |
---|---|
bin | 11111010100101101100… |
… | …01011100101010010111 |
3 | 10210220001012110102010012 |
4 | 33222112301130222113 |
5 | 120113200432300410 |
6 | 2142233210350435 |
7 | 140521002455624 |
oct | 17522661345227 |
9 | 3726035412105 |
10 | 1076271368855 |
11 | 385498147231 |
12 | 15470912b41b |
13 | 7a651a93b27 |
14 | 3a13dd0b34b |
15 | 1cee2715605 |
hex | fa96c5ca97 |
1076271368855 has 4 divisors (see below), whose sum is σ = 1291525642632. Its totient is φ = 861017095080.
The previous prime is 1076271368771. The next prime is 1076271368929. The reversal of 1076271368855 is 5588631726701.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1076271368855 - 212 = 1076271364759 is a prime.
It is a super-2 number, since 2×10762713688552 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1076271368794 and 1076271368803.
It is a congruent number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 107627136881 + ... + 107627136890.
It is an arithmetic number, because the mean of its divisors is an integer number (322881410658).
Almost surely, 21076271368855 is an apocalyptic number.
1076271368855 is a deficient number, since it is larger than the sum of its proper divisors (215254273777).
1076271368855 is an equidigital number, since it uses as much as digits as its factorization.
1076271368855 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215254273776.
The product of its (nonzero) digits is 16934400, while the sum is 59.
The spelling of 1076271368855 in words is "one trillion, seventy-six billion, two hundred seventy-one million, three hundred sixty-eight thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •