Base | Representation |
---|---|
bin | 1010010110110101… |
… | …1010010000000001 |
3 | 21011202022222111001 |
4 | 2211231122100001 |
5 | 21143204112031 |
6 | 1135512052001 |
7 | 125615560651 |
oct | 24555322001 |
9 | 7152288431 |
10 | 2780144641 |
11 | 11a73568aa |
12 | 657094001 |
13 | 353c97901 |
14 | 1c5336361 |
15 | 114116861 |
hex | a5b5a401 |
2780144641 has 2 divisors, whose sum is σ = 2780144642. Its totient is φ = 2780144640.
The previous prime is 2780144639. The next prime is 2780144663. The reversal of 2780144641 is 1464410872.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2368866241 + 411278400 = 48671^2 + 20280^2 .
It is a cyclic number.
It is not a de Polignac number, because 2780144641 - 21 = 2780144639 is a prime.
Together with 2780144639, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 2780144641.
It is not a weakly prime, because it can be changed into another prime (2780144041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1390072320 + 1390072321.
It is an arithmetic number, because the mean of its divisors is an integer number (1390072321).
Almost surely, 22780144641 is an apocalyptic number.
It is an amenable number.
2780144641 is a deficient number, since it is larger than the sum of its proper divisors (1).
2780144641 is an equidigital number, since it uses as much as digits as its factorization.
2780144641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43008, while the sum is 37.
The square root of 2780144641 is about 52727.0769244797. The cubic root of 2780144641 is about 1406.1202534424.
The spelling of 2780144641 in words is "two billion, seven hundred eighty million, one hundred forty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •