Base | Representation |
---|---|
bin | 111000000010100100100… |
… | …0000000101010000000001 |
3 | 1000021022110200002022220111 |
4 | 1300011021000011100001 |
5 | 2002142400341320001 |
6 | 24214144005111321 |
7 | 1423313150214061 |
oct | 160051100052001 |
9 | 30238420068814 |
10 | 7702101120001 |
11 | 24aa49631a552 |
12 | a448760b8541 |
13 | 43b3c7186132 |
14 | 1c8ad85d93a1 |
15 | d5538e90851 |
hex | 70149005401 |
7702101120001 has 2 divisors, whose sum is σ = 7702101120002. Its totient is φ = 7702101120000.
The previous prime is 7702101119989. The next prime is 7702101120167. The reversal of 7702101120001 is 1000211012077.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7093699560000 + 608401560001 = 2663400^2 + 780001^2 .
It is an emirp because it is prime and its reverse (1000211012077) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-7702101120001 is a prime.
It is not a weakly prime, because it can be changed into another prime (7702101120601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3851050560000 + 3851050560001.
It is an arithmetic number, because the mean of its divisors is an integer number (3851050560001).
Almost surely, 27702101120001 is an apocalyptic number.
It is an amenable number.
7702101120001 is a deficient number, since it is larger than the sum of its proper divisors (1).
7702101120001 is an equidigital number, since it uses as much as digits as its factorization.
7702101120001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 196, while the sum is 22.
Adding to 7702101120001 its reverse (1000211012077), we get a palindrome (8702312132078).
The spelling of 7702101120001 in words is "seven trillion, seven hundred two billion, one hundred one million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •