Base | Representation |
---|---|
bin | 10011001000101110… |
… | …01110001010110101 |
3 | 222111222212020200001 |
4 | 21210113032022311 |
5 | 132020034243131 |
6 | 4415241551301 |
7 | 512410244035 |
oct | 114427161265 |
9 | 28458766601 |
10 | 10273743541 |
11 | 43a2295646 |
12 | 1ba87a5531 |
13 | c796241b9 |
14 | 6d665d8c5 |
15 | 401e32261 |
hex | 2645ce2b5 |
10273743541 has 2 divisors, whose sum is σ = 10273743542. Its totient is φ = 10273743540.
The previous prime is 10273743497. The next prime is 10273743547. The reversal of 10273743541 is 14534737201.
10273743541 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6934059441 + 3339684100 = 83271^2 + 57790^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10273743541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10273743541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10273743547) 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, 5136871770 + 5136871771.
It is an arithmetic number, because the mean of its divisors is an integer number (5136871771).
Almost surely, 210273743541 is an apocalyptic number.
It is an amenable number.
10273743541 is a deficient number, since it is larger than the sum of its proper divisors (1).
10273743541 is an equidigital number, since it uses as much as digits as its factorization.
10273743541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70560, while the sum is 37.
The spelling of 10273743541 in words is "ten billion, two hundred seventy-three million, seven hundred forty-three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •