Base | Representation |
---|---|
bin | 10011100010110001… |
… | …01111111011010001 |
3 | 1000002020000102002221 |
4 | 21301120233323101 |
5 | 132442003412021 |
6 | 4453045141041 |
7 | 521002430422 |
oct | 116130577321 |
9 | 30066012087 |
10 | 10492247761 |
11 | 44a4667046 |
12 | 20499ba781 |
13 | cb2989b38 |
14 | 71769b649 |
15 | 4161e4241 |
hex | 27162fed1 |
10492247761 has 4 divisors (see below), whose sum is σ = 10506562612. Its totient is φ = 10477932912.
The previous prime is 10492247743. The next prime is 10492247789. The reversal of 10492247761 is 16774229401.
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 5953665600 + 4538582161 = 77160^2 + 67369^2 .
It is a cyclic number.
It is not a de Polignac number, because 10492247761 - 217 = 10492116689 is a prime.
It is a super-2 number, since 2×104922477612 (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 (10492247261) 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 3 ways as a sum of consecutive naturals, for example, 7156326 + ... + 7157791.
It is an arithmetic number, because the mean of its divisors is an integer number (2626640653).
Almost surely, 210492247761 is an apocalyptic number.
It is an amenable number.
10492247761 is a deficient number, since it is larger than the sum of its proper divisors (14314851).
10492247761 is an equidigital number, since it uses as much as digits as its factorization.
10492247761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14314850.
The product of its (nonzero) digits is 169344, while the sum is 43.
The spelling of 10492247761 in words is "ten billion, four hundred ninety-two million, two hundred forty-seven thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •