Base | Representation |
---|---|
bin | 10111001111011111111101… |
… | …011000010001011001111101 |
3 | 111101221011010221022012111212 |
4 | 113033133331120101121331 |
5 | 101344233410441112101 |
6 | 1001223145031254205 |
7 | 30350110203046625 |
oct | 2717377530213175 |
9 | 441834127265455 |
10 | 102220177675901 |
11 | 2a63037447276a |
12 | b56ab5681a365 |
13 | 450642414317c |
14 | 1b356a94b9885 |
15 | bc3eac3871bb |
hex | 5cf7fd61167d |
102220177675901 has 2 divisors, whose sum is σ = 102220177675902. Its totient is φ = 102220177675900.
The previous prime is 102220177675793. The next prime is 102220177675907. The reversal of 102220177675901 is 109576771022201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100697110692025 + 1523066983876 = 10034795^2 + 1234126^2 .
It is a cyclic number.
It is not a de Polignac number, because 102220177675901 - 210 = 102220177674877 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102220177675901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102220177675907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51110088837950 + 51110088837951.
It is an arithmetic number, because the mean of its divisors is an integer number (51110088837951).
Almost surely, 2102220177675901 is an apocalyptic number.
It is an amenable number.
102220177675901 is a deficient number, since it is larger than the sum of its proper divisors (1).
102220177675901 is an equidigital number, since it uses as much as digits as its factorization.
102220177675901 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 740880, while the sum is 50.
The spelling of 102220177675901 in words is "one hundred two trillion, two hundred twenty billion, one hundred seventy-seven million, six hundred seventy-five thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •