Base | Representation |
---|---|
bin | 10111001111100010000101… |
… | …001000100011101000111101 |
3 | 111101221101000122222100022212 |
4 | 113033202011020203220331 |
5 | 101344303042021221121 |
6 | 1001224203031550205 |
7 | 30350220510140654 |
oct | 2717420510435075 |
9 | 441841018870285 |
10 | 102222455257661 |
11 | 2a631333071642 |
12 | b56b49152b365 |
13 | 45066c7c6929b |
14 | 1b35843b9019b |
15 | bc40922cb25b |
hex | 5cf885223a3d |
102222455257661 has 2 divisors, whose sum is σ = 102222455257662. Its totient is φ = 102222455257660.
The previous prime is 102222455257631. The next prime is 102222455257673. The reversal of 102222455257661 is 166752554222201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76373721510436 + 25848733747225 = 8739206^2 + 5084165^2 .
It is a cyclic number.
It is not a de Polignac number, because 102222455257661 - 210 = 102222455256637 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102222455257631) by changing a digit.
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 as a sum of consecutive naturals, namely, 51111227628830 + 51111227628831.
It is an arithmetic number, because the mean of its divisors is an integer number (51111227628831).
Almost surely, 2102222455257661 is an apocalyptic number.
It is an amenable number.
102222455257661 is a deficient number, since it is larger than the sum of its proper divisors (1).
102222455257661 is an equidigital number, since it uses as much as digits as its factorization.
102222455257661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032000, while the sum is 50.
The spelling of 102222455257661 in words is "one hundred two trillion, two hundred twenty-two billion, four hundred fifty-five million, two hundred fifty-seven thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •