Base | Representation |
---|---|
bin | 10000001101101… |
… | …001111001001001 |
3 | 200221211210022201 |
4 | 100031221321021 |
5 | 1024113434141 |
6 | 42554120201 |
7 | 6512042263 |
oct | 2015517111 |
9 | 627753281 |
10 | 272014921 |
11 | 12a5aa922 |
12 | 77120061 |
13 | 4447cc99 |
14 | 281aab33 |
15 | 18d32031 |
hex | 10369e49 |
272014921 has 8 divisors (see below), whose sum is σ = 281694024. Its totient is φ = 262504320.
The previous prime is 272014913. The next prime is 272014927. The reversal of 272014921 is 129410272.
It can be written as a sum of positive squares in 4 ways, for example, as 39879225 + 232135696 = 6315^2 + 15236^2 .
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 272014921 - 23 = 272014913 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 272014921.
It is not an unprimeable number, because it can be changed into a prime (272014927) 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, 38836 + ... + 45301.
It is an arithmetic number, because the mean of its divisors is an integer number (35211753).
Almost surely, 2272014921 is an apocalyptic number.
It is an amenable number.
272014921 is a deficient number, since it is larger than the sum of its proper divisors (9679103).
272014921 is an equidigital number, since it uses as much as digits as its factorization.
272014921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84251.
The product of its (nonzero) digits is 2016, while the sum is 28.
The square root of 272014921 is about 16492.8748555247. The cubic root of 272014921 is about 647.9342076486.
The spelling of 272014921 in words is "two hundred seventy-two million, fourteen thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •