Base | Representation |
---|---|
bin | 10000001110100… |
… | …101111011000001 |
3 | 200222022021121101 |
4 | 100032211323001 |
5 | 1024144321201 |
6 | 43003254401 |
7 | 6514115161 |
oct | 2016457301 |
9 | 628267541 |
10 | 272260801 |
11 | 12a75862a |
12 | 7721a401 |
13 | 44537b87 |
14 | 282325a1 |
15 | 18d7ed01 |
hex | 103a5ec1 |
272260801 has 8 divisors (see below), whose sum is σ = 278974080. Its totient is φ = 265585968.
The previous prime is 272260799. The next prime is 272260811. The reversal of 272260801 is 108062272.
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 272260801 - 21 = 272260799 is a prime.
It is a super-2 number, since 2×2722608012 = 148251887522323202, which contains 22 as substring.
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 272260801.
It is not an unprimeable number, because it can be changed into a prime (272260811) 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, 4995 + ... + 23863.
It is an arithmetic number, because the mean of its divisors is an integer number (34871760).
Almost surely, 2272260801 is an apocalyptic number.
It is an amenable number.
272260801 is a deficient number, since it is larger than the sum of its proper divisors (6713279).
272260801 is a wasteful number, since it uses less digits than its factorization.
272260801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19223.
The product of its (nonzero) digits is 2688, while the sum is 28.
The square root of 272260801 is about 16500.3272997841. The cubic root of 272260801 is about 648.1293759676.
The spelling of 272260801 in words is "two hundred seventy-two million, two hundred sixty thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •