Base | Representation |
---|---|
bin | 1001111001000000… |
… | …0111111110101001 |
3 | 20212000220100111112 |
4 | 2132100013332221 |
5 | 20414141331423 |
6 | 1115242240105 |
7 | 122536233554 |
oct | 23620077651 |
9 | 6760810445 |
10 | 2655027113 |
11 | 114276a192 |
12 | 6211b6035 |
13 | 33409b57b |
14 | 1b288769b |
15 | 10814ea78 |
hex | 9e407fa9 |
2655027113 has 2 divisors, whose sum is σ = 2655027114. Its totient is φ = 2655027112.
The previous prime is 2655027107. The next prime is 2655027143. The reversal of 2655027113 is 3117205562.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2536935424 + 118091689 = 50368^2 + 10867^2 .
It is a cyclic number.
It is not a de Polignac number, because 2655027113 - 26 = 2655027049 is a prime.
It is a super-2 number, since 2×26550271132 = 14098337941530229538, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2655027113.
It is not a weakly prime, because it can be changed into another prime (2655027143) 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, 1327513556 + 1327513557.
It is an arithmetic number, because the mean of its divisors is an integer number (1327513557).
Almost surely, 22655027113 is an apocalyptic number.
It is an amenable number.
2655027113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2655027113 is an equidigital number, since it uses as much as digits as its factorization.
2655027113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 32.
The square root of 2655027113 is about 51526.9552079298. The cubic root of 2655027113 is about 1384.7020021202.
The spelling of 2655027113 in words is "two billion, six hundred fifty-five million, twenty-seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.074 sec. • engine limits •