Base | Representation |
---|---|
bin | 10101011000111011… |
… | …000101100111000001 |
3 | 2012021120221022022212 |
4 | 111120323011213001 |
5 | 334013440032321 |
6 | 14314544311505 |
7 | 1442064623102 |
oct | 253073054701 |
9 | 65246838285 |
10 | 22966720961 |
11 | 981612a428 |
12 | 454b612595 |
13 | 2220209822 |
14 | 117c3083a9 |
15 | 8e643955b |
hex | 558ec59c1 |
22966720961 has 4 divisors (see below), whose sum is σ = 23056085892. Its totient is φ = 22877356032.
The previous prime is 22966720957. The next prime is 22966720967. The reversal of 22966720961 is 16902766922.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16902766922 = 2 ⋅8451383461.
It can be written as a sum of positive squares in 2 ways, for example, as 11099886736 + 11866834225 = 105356^2 + 108935^2 .
It is a cyclic number.
It is not a de Polignac number, because 22966720961 - 22 = 22966720957 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22966720967) 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 in 3 ways as a sum of consecutive naturals, for example, 44682080 + ... + 44682593.
It is an arithmetic number, because the mean of its divisors is an integer number (5764021473).
Almost surely, 222966720961 is an apocalyptic number.
It is an amenable number.
22966720961 is a deficient number, since it is larger than the sum of its proper divisors (89364931).
22966720961 is an equidigital number, since it uses as much as digits as its factorization.
22966720961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89364930.
The product of its (nonzero) digits is 979776, while the sum is 50.
The spelling of 22966720961 in words is "twenty-two billion, nine hundred sixty-six million, seven hundred twenty thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •