Base | Representation |
---|---|
bin | 1111110111100010110… |
… | …1111100100100110001 |
3 | 222001122112111221221211 |
4 | 3331320231330210301 |
5 | 13431300203001121 |
6 | 325122352520121 |
7 | 25460325615352 |
oct | 3757055744461 |
9 | 861575457854 |
10 | 272608250161 |
11 | a5681283215 |
12 | 449bbb50041 |
13 | 1c925c37a00 |
14 | d2a1285d29 |
15 | 7157a44ce1 |
hex | 3f78b7c931 |
272608250161 has 9 divisors (see below), whose sum is σ = 295198532139. Its totient is φ = 251632119336.
The previous prime is 272608250153. The next prime is 272608250177. The reversal of 272608250161 is 161052806272.
The square root of 272608250161 is 522119.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 40326664225 + 232281585936 = 200815^2 + 481956^2 .
It is not a de Polignac number, because 272608250161 - 23 = 272608250153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (272608250261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 6767466 + ... + 6807628.
Almost surely, 2272608250161 is an apocalyptic number.
272608250161 is the 522119-th square number.
272608250161 is the 261060-th centered octagonal number.
It is an amenable number.
272608250161 is a deficient number, since it is larger than the sum of its proper divisors (22590281978).
272608250161 is an frugal number, since it uses more digits than its factorization.
272608250161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80352 (or 40176 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 40.
The spelling of 272608250161 in words is "two hundred seventy-two billion, six hundred eight million, two hundred fifty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •