Base | Representation |
---|---|
bin | 10000001111111… |
… | …011110101111011 |
3 | 200222222011100211 |
4 | 100033323311323 |
5 | 1024242101411 |
6 | 43015011551 |
7 | 6520112206 |
oct | 2017736573 |
9 | 628864324 |
10 | 272612731 |
11 | 12a978a86 |
12 | 77369bb7 |
13 | 4462c111 |
14 | 282c493d |
15 | 18dee221 |
hex | 103fbd7b |
272612731 has 16 divisors (see below), whose sum is σ = 305907840. Its totient is φ = 241669120.
The previous prime is 272612723. The next prime is 272612849. The reversal of 272612731 is 137216272.
It is a cyclic number.
It is not a de Polignac number, because 272612731 - 23 = 272612723 is a prime.
It is a super-2 number, since 2×2726127312 = 148635402206556722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 272612693 and 272612702.
It is not an unprimeable number, because it can be changed into a prime (272610731) 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 in 15 ways as a sum of consecutive naturals, for example, 13470 + ... + 26956.
It is an arithmetic number, because the mean of its divisors is an integer number (19119240).
Almost surely, 2272612731 is an apocalyptic number.
272612731 is a deficient number, since it is larger than the sum of its proper divisors (33295109).
272612731 is a wasteful number, since it uses less digits than its factorization.
272612731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13574.
The product of its digits is 7056, while the sum is 31.
The square root of 272612731 is about 16510.9881896875. The cubic root of 272612731 is about 648.4085175852.
It can be divided in two parts, 27261 and 2731, that added together give a palindrome (29992).
The spelling of 272612731 in words is "two hundred seventy-two million, six hundred twelve thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •