Base | Representation |
---|---|
bin | 101000000101110000101… |
… | …100110010111101000101 |
3 | 100202101001020100210221101 |
4 | 220011300230302331011 |
5 | 330114131443443343 |
6 | 5505340253220101 |
7 | 403016411442331 |
oct | 50056054627505 |
9 | 10671036323841 |
10 | 2754964827973 |
11 | 972412907246 |
12 | 385b20191631 |
13 | 16ca3b236757 |
14 | 974aba2c7c1 |
15 | 4b9e2734e4d |
hex | 28170b32f45 |
2754964827973 has 2 divisors, whose sum is σ = 2754964827974. Its totient is φ = 2754964827972.
The previous prime is 2754964827947. The next prime is 2754964827983. The reversal of 2754964827973 is 3797284694572.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2069276496004 + 685688331969 = 1438498^2 + 828063^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2754964827973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2754964827896 and 2754964827905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2754964827913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1377482413986 + 1377482413987.
It is an arithmetic number, because the mean of its divisors is an integer number (1377482413987).
Almost surely, 22754964827973 is an apocalyptic number.
It is an amenable number.
2754964827973 is a deficient number, since it is larger than the sum of its proper divisors (1).
2754964827973 is an equidigital number, since it uses as much as digits as its factorization.
2754964827973 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1280240640, while the sum is 73.
The spelling of 2754964827973 in words is "two trillion, seven hundred fifty-four billion, nine hundred sixty-four million, eight hundred twenty-seven thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •