Base | Representation |
---|---|
bin | 10011000010101000… |
… | …01010010010011001 |
3 | 222101102122101000221 |
4 | 21201110022102121 |
5 | 131413442001221 |
6 | 4410214000041 |
7 | 511216514263 |
oct | 114124122231 |
9 | 28342571027 |
10 | 10222609561 |
11 | 437643a95a |
12 | 1b93646021 |
13 | c6bb5c8c8 |
14 | 6cd94cb33 |
15 | 3ec6d1541 |
hex | 26150a499 |
10222609561 has 4 divisors (see below), whose sum is σ = 10252944052. Its totient is φ = 10192275072.
The previous prime is 10222609513. The next prime is 10222609589. The reversal of 10222609561 is 16590622201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2340721161 + 7881888400 = 48381^2 + 88780^2 .
It is a cyclic number.
It is not a de Polignac number, because 10222609561 - 233 = 1632674969 is a prime.
It is a super-2 number, since 2×102226095612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10222609511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15166740 + ... + 15167413.
It is an arithmetic number, because the mean of its divisors is an integer number (2563236013).
Almost surely, 210222609561 is an apocalyptic number.
It is an amenable number.
10222609561 is a deficient number, since it is larger than the sum of its proper divisors (30334491).
10222609561 is an equidigital number, since it uses as much as digits as its factorization.
10222609561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30334490.
The product of its (nonzero) digits is 12960, while the sum is 34.
The spelling of 10222609561 in words is "ten billion, two hundred twenty-two million, six hundred nine thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •