Base | Representation |
---|---|
bin | 100000111110011010000… |
… | …000101010100010100101 |
3 | 22000122000122021220202222 |
4 | 200332122000222202211 |
5 | 244111313044134001 |
6 | 4453000042042125 |
7 | 322500243024242 |
oct | 40763200524245 |
9 | 8018018256688 |
10 | 2266031630501 |
11 | 7a4022864341 |
12 | 3072094a9345 |
13 | 1358bbb02652 |
14 | 7b9685085c9 |
15 | 3de2848961b |
hex | 20f9a02a8a5 |
2266031630501 has 2 divisors, whose sum is σ = 2266031630502. Its totient is φ = 2266031630500.
The previous prime is 2266031630491. The next prime is 2266031630507. The reversal of 2266031630501 is 1050361306622.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1683597076225 + 582434554276 = 1297535^2 + 763174^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2266031630501 is a prime.
It is a super-2 number, since 2×22660316305012 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2266031630507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1133015815250 + 1133015815251.
It is an arithmetic number, because the mean of its divisors is an integer number (1133015815251).
Almost surely, 22266031630501 is an apocalyptic number.
It is an amenable number.
2266031630501 is a deficient number, since it is larger than the sum of its proper divisors (1).
2266031630501 is an equidigital number, since it uses as much as digits as its factorization.
2266031630501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 35.
The spelling of 2266031630501 in words is "two trillion, two hundred sixty-six billion, thirty-one million, six hundred thirty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •