Base | Representation |
---|---|
bin | 10011111010011000… |
… | …10101111101100001 |
3 | 1000121000201122020222 |
4 | 21331030111331201 |
5 | 133343210303043 |
6 | 4524442412425 |
7 | 525626145221 |
oct | 117514257541 |
9 | 30530648228 |
10 | 10690322273 |
11 | 4596454394 |
12 | 20a4201115 |
13 | 1014a1b8a7 |
14 | 735adc081 |
15 | 4287bcd68 |
hex | 27d315f61 |
10690322273 has 8 divisors (see below), whose sum is σ = 10982375592. Its totient is φ = 10398433536.
The previous prime is 10690322267. The next prime is 10690322281. The reversal of 10690322273 is 37222309601.
It can be written as a sum of positive squares in 4 ways, for example, as 7539969889 + 3150352384 = 86833^2 + 56128^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10690322273 - 214 = 10690305889 is a prime.
It is a super-2 number, since 2×106903222732 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10690322233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96761 + ... + 175337.
It is an arithmetic number, because the mean of its divisors is an integer number (1372796949).
Almost surely, 210690322273 is an apocalyptic number.
It is an amenable number.
10690322273 is a deficient number, since it is larger than the sum of its proper divisors (292053319).
10690322273 is an equidigital number, since it uses as much as digits as its factorization.
10690322273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82291.
The product of its (nonzero) digits is 27216, while the sum is 35.
The spelling of 10690322273 in words is "ten billion, six hundred ninety million, three hundred twenty-two thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •