Base | Representation |
---|---|
bin | 10111001111001101001010… |
… | …110000011001111000111101 |
3 | 111101212020001210100102221022 |
4 | 113033031022300121320331 |
5 | 101343421100224330021 |
6 | 1001210010551313525 |
7 | 30345464204165516 |
oct | 2717151260317075 |
9 | 441766053312838 |
10 | 102200001011261 |
11 | 2a622860249a0a |
12 | b56706567b8a5 |
13 | 4504559c9185a |
14 | 1b34713967a0d |
15 | bc36cad711ab |
hex | 5cf34ac19e3d |
102200001011261 has 2 divisors, whose sum is σ = 102200001011262. Its totient is φ = 102200001011260.
The previous prime is 102200001011249. The next prime is 102200001011263. The reversal of 102200001011261 is 162110100002201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88070904852100 + 14129096159161 = 9384610^2 + 3758869^2 .
It is a cyclic number.
It is not a de Polignac number, because 102200001011261 - 218 = 102200000749117 is a prime.
Together with 102200001011263, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102200001011263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51100000505630 + 51100000505631.
It is an arithmetic number, because the mean of its divisors is an integer number (51100000505631).
Almost surely, 2102200001011261 is an apocalyptic number.
It is an amenable number.
102200001011261 is a deficient number, since it is larger than the sum of its proper divisors (1).
102200001011261 is an equidigital number, since it uses as much as digits as its factorization.
102200001011261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 102200001011261 its reverse (162110100002201), we get a palindrome (264310101013462).
The spelling of 102200001011261 in words is "one hundred two trillion, two hundred billion, one million, eleven thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •