Base | Representation |
---|---|
bin | 1010100011110010101110… |
… | …11100001010001010111101 |
3 | 10001012211000220211022000011 |
4 | 11101321113130022022331 |
5 | 11020414140402423121 |
6 | 121215052015303221 |
7 | 4614410511103651 |
oct | 521712734121275 |
9 | 101184026738004 |
10 | 23220060201661 |
11 | 7442632702374 |
12 | 273025321ab11 |
13 | cc58471283cb |
14 | 5a3bdd50ca61 |
15 | 2a4018c0c7e1 |
hex | 151e5770a2bd |
23220060201661 has 2 divisors, whose sum is σ = 23220060201662. Its totient is φ = 23220060201660.
The previous prime is 23220060201649. The next prime is 23220060201707. The reversal of 23220060201661 is 16610206002232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22850646655225 + 369413546436 = 4780235^2 + 607794^2 .
It is a cyclic number.
It is not a de Polignac number, because 23220060201661 - 223 = 23220051813053 is a prime.
It is a super-2 number, since 2×232200602016612 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23220060201461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11610030100830 + 11610030100831.
It is an arithmetic number, because the mean of its divisors is an integer number (11610030100831).
Almost surely, 223220060201661 is an apocalyptic number.
It is an amenable number.
23220060201661 is a deficient number, since it is larger than the sum of its proper divisors (1).
23220060201661 is an equidigital number, since it uses as much as digits as its factorization.
23220060201661 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 23220060201661 its reverse (16610206002232), we get a palindrome (39830266203893).
The spelling of 23220060201661 in words is "twenty-three trillion, two hundred twenty billion, sixty million, two hundred one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •