Base | Representation |
---|---|
bin | 10000010000000… |
… | …011101110110111 |
3 | 201000000210200201 |
4 | 100100003232313 |
5 | 1024244120142 |
6 | 43015421331 |
7 | 6520305343 |
oct | 2020035667 |
9 | 630023621 |
10 | 272645047 |
11 | 12a9a0294 |
12 | 77384847 |
13 | 44640a3c |
14 | 282d2623 |
15 | 18e08ab7 |
hex | 10403bb7 |
272645047 has 8 divisors (see below), whose sum is σ = 274742640. Its totient is φ = 270552960.
The previous prime is 272645011. The next prime is 272645053. The reversal of 272645047 is 740546272.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 272645047 - 211 = 272642999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 272644997 and 272645015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (272645057) 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 in 7 ways as a sum of consecutive naturals, for example, 199647 + ... + 201007.
It is an arithmetic number, because the mean of its divisors is an integer number (34342830).
Almost surely, 2272645047 is an apocalyptic number.
272645047 is a deficient number, since it is larger than the sum of its proper divisors (2097593).
272645047 is a wasteful number, since it uses less digits than its factorization.
272645047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2753.
The product of its (nonzero) digits is 94080, while the sum is 37.
The square root of 272645047 is about 16511.9667817011. The cubic root of 272645047 is about 648.4341377407.
The spelling of 272645047 in words is "two hundred seventy-two million, six hundred forty-five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •