Base | Representation |
---|---|
bin | 101010111011101000111… |
… | …001100010110110111101 |
3 | 101110001010100012121220012 |
4 | 222323220321202312331 |
5 | 341314110232323112 |
6 | 10135154534433005 |
7 | 423102032300054 |
oct | 52735071426675 |
9 | 11401110177805 |
10 | 2950254964157 |
11 | a38218018006 |
12 | 3b7942502765 |
13 | 185291850257 |
14 | a2b163b539b |
15 | 51b22464022 |
hex | 2aee8e62dbd |
2950254964157 has 2 divisors, whose sum is σ = 2950254964158. Its totient is φ = 2950254964156.
The previous prime is 2950254964147. The next prime is 2950254964187. The reversal of 2950254964157 is 7514694520592.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2878787496601 + 71467467556 = 1696699^2 + 267334^2 .
It is a cyclic number.
It is not a de Polignac number, because 2950254964157 - 234 = 2933075094973 is a prime.
It is a super-3 number, since 3×29502549641573 (a number of 38 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2950254964096 and 2950254964105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2950254964147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1475127482078 + 1475127482079.
It is an arithmetic number, because the mean of its divisors is an integer number (1475127482079).
Almost surely, 22950254964157 is an apocalyptic number.
It is an amenable number.
2950254964157 is a deficient number, since it is larger than the sum of its proper divisors (1).
2950254964157 is an equidigital number, since it uses as much as digits as its factorization.
2950254964157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216000, while the sum is 59.
The spelling of 2950254964157 in words is "two trillion, nine hundred fifty billion, two hundred fifty-four million, nine hundred sixty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •