Base | Representation |
---|---|
bin | 1001111000110011… |
… | …0000111001011101 |
3 | 20211222020121000221 |
4 | 2132030300321131 |
5 | 20413430134031 |
6 | 1115211321341 |
7 | 122525604253 |
oct | 23614607135 |
9 | 6758217027 |
10 | 2654146141 |
11 | 1142218309 |
12 | 620a50251 |
13 | 333b5059a |
14 | 1b26d85d3 |
15 | 108028a11 |
hex | 9e330e5d |
2654146141 has 2 divisors, whose sum is σ = 2654146142. Its totient is φ = 2654146140.
The previous prime is 2654146139. The next prime is 2654146181. The reversal of 2654146141 is 1416414562.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2596310116 + 57836025 = 50954^2 + 7605^2 .
It is a cyclic number.
It is not a de Polignac number, because 2654146141 - 21 = 2654146139 is a prime.
Together with 2654146139, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2654146097 and 2654146106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2654146181) 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, 1327073070 + 1327073071.
It is an arithmetic number, because the mean of its divisors is an integer number (1327073071).
Almost surely, 22654146141 is an apocalyptic number.
It is an amenable number.
2654146141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2654146141 is an equidigital number, since it uses as much as digits as its factorization.
2654146141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23040, while the sum is 34.
The square root of 2654146141 is about 51518.4058468427. The cubic root of 2654146141 is about 1384.5488312247.
The spelling of 2654146141 in words is "two billion, six hundred fifty-four million, one hundred forty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •