Base | Representation |
---|---|
bin | 10000001110100… |
… | …011010010001111 |
3 | 200222021201210022 |
4 | 100032203102033 |
5 | 1024143444444 |
6 | 43003132355 |
7 | 6514041530 |
oct | 2016432217 |
9 | 628251708 |
10 | 272249999 |
11 | 12a7504aa |
12 | 772140bb |
13 | 44532c98 |
14 | 2822c687 |
15 | 18d7b9ee |
hex | 103a348f |
272249999 has 16 divisors (see below), whose sum is σ = 322574400. Its totient is φ = 224818944.
The previous prime is 272249977. The next prime is 272250001. The reversal of 272249999 is 999942272.
It is a Cunningham number, because it is equal to 165002-1.
It is not a de Polignac number, because 272249999 - 228 = 3814543 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 272249999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (272249599) 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 15 ways as a sum of consecutive naturals, for example, 114329 + ... + 116685.
It is an arithmetic number, because the mean of its divisors is an integer number (20160900).
Almost surely, 2272249999 is an apocalyptic number.
272249999 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
272249999 is a deficient number, since it is larger than the sum of its proper divisors (50324401).
272249999 is a wasteful number, since it uses less digits than its factorization.
272249999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2962.
The product of its digits is 1469664, while the sum is 53.
The square root of 272249999 is about 16499.9999696970. Note that the first 4 decimals coincide. The cubic root of 272249999 is about 648.1208043014.
The spelling of 272249999 in words is "two hundred seventy-two million, two hundred forty-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •