Base | Representation |
---|---|
bin | 1010001011001000… |
… | …1100110011101101 |
3 | 21001022222122212212 |
4 | 2202302030303231 |
5 | 21043123144103 |
6 | 1131000140205 |
7 | 124451462165 |
oct | 24262146355 |
9 | 7038878785 |
10 | 2731068653 |
11 | 1181687335 |
12 | 642767665 |
13 | 346a73c71 |
14 | 1bc9dd5a5 |
15 | 10eb707d8 |
hex | a2c8cced |
2731068653 has 2 divisors, whose sum is σ = 2731068654. Its totient is φ = 2731068652.
The previous prime is 2731068617. The next prime is 2731068719. The reversal of 2731068653 is 3568601372.
2731068653 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., 2660290084 + 70778569 = 51578^2 + 8413^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2731068653 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2731068653.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2731068253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1365534326 + 1365534327.
It is an arithmetic number, because the mean of its divisors is an integer number (1365534327).
Almost surely, 22731068653 is an apocalyptic number.
It is an amenable number.
2731068653 is a deficient number, since it is larger than the sum of its proper divisors (1).
2731068653 is an equidigital number, since it uses as much as digits as its factorization.
2731068653 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 181440, while the sum is 41.
The square root of 2731068653 is about 52259.6273714232. The cubic root of 2731068653 is about 1397.7973275971.
The spelling of 2731068653 in words is "two billion, seven hundred thirty-one million, sixty-eight thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •