Base | Representation |
---|---|
bin | 10011001000101110… |
… | …00101001011110101 |
3 | 222111222210101012002 |
4 | 21210113011023311 |
5 | 132020032103431 |
6 | 4415241105045 |
7 | 512410031534 |
oct | 114427051365 |
9 | 28458711162 |
10 | 10273706741 |
11 | 43a226aa31 |
12 | 1ba8788185 |
13 | c7961051c |
14 | 6d665031b |
15 | 401e263cb |
hex | 2645c52f5 |
10273706741 has 2 divisors, whose sum is σ = 10273706742. Its totient is φ = 10273706740.
The previous prime is 10273706711. The next prime is 10273706777. The reversal of 10273706741 is 14760737201.
10273706741 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9573839716 + 699867025 = 97846^2 + 26455^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10273706741 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10273706695 and 10273706704.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10273706711) 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, 5136853370 + 5136853371.
It is an arithmetic number, because the mean of its divisors is an integer number (5136853371).
Almost surely, 210273706741 is an apocalyptic number.
It is an amenable number.
10273706741 is a deficient number, since it is larger than the sum of its proper divisors (1).
10273706741 is an equidigital number, since it uses as much as digits as its factorization.
10273706741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 49392, while the sum is 38.
The spelling of 10273706741 in words is "ten billion, two hundred seventy-three million, seven hundred six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •