Base | Representation |
---|---|
bin | 11111010101100000111… |
… | …00111010110000100001 |
3 | 10210221011020010122002202 |
4 | 33222300130322300201 |
5 | 120120041230212341 |
6 | 2142344040422545 |
7 | 140534453435666 |
oct | 17526034726041 |
9 | 3727136118082 |
10 | 1076702194721 |
11 | 38569935706a |
12 | 154809477a55 |
13 | 7a6c010928a |
14 | 3a181217a6d |
15 | 1d01a46779b |
hex | fab073ac21 |
1076702194721 has 2 divisors, whose sum is σ = 1076702194722. Its totient is φ = 1076702194720.
The previous prime is 1076702194663. The next prime is 1076702194727. The reversal of 1076702194721 is 1274912076701.
It is a happy number.
1076702194721 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1062136360000 + 14565834721 = 1030600^2 + 120689^2 .
It is a cyclic number.
It is not a de Polignac number, because 1076702194721 - 230 = 1075628452897 is a prime.
It is a super-2 number, since 2×10767021947212 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1076702194727) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 538351097360 + 538351097361.
It is an arithmetic number, because the mean of its divisors is an integer number (538351097361).
Almost surely, 21076702194721 is an apocalyptic number.
It is an amenable number.
1076702194721 is a deficient number, since it is larger than the sum of its proper divisors (1).
1076702194721 is an equidigital number, since it uses as much as digits as its factorization.
1076702194721 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 296352, while the sum is 47.
The spelling of 1076702194721 in words is "one trillion, seventy-six billion, seven hundred two million, one hundred ninety-four thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •