Base | Representation |
---|---|
bin | 10000000111001… |
… | …000110010110001 |
3 | 200211121222210011 |
4 | 100013020302301 |
5 | 1023144301411 |
6 | 42453334521 |
7 | 6461365354 |
oct | 2007106261 |
9 | 624558704 |
10 | 270306481 |
11 | 129643295 |
12 | 76637441 |
13 | 44002483 |
14 | 27c8429b |
15 | 18ae5c21 |
hex | 101c8cb1 |
270306481 has 9 divisors (see below), whose sum is σ = 277752769. Its totient is φ = 263056000.
The previous prime is 270306461. The next prime is 270306493. The reversal of 270306481 is 184603072.
The square root of 270306481 is 16441.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 3964081 + 266342400 = 1991^2 + 16320^2 .
It is not a de Polignac number, because 270306481 - 213 = 270298289 is a prime.
It is a super-2 number, since 2×2703064812 = 146131187341206722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (270306461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 673881 + ... + 674281.
Almost surely, 2270306481 is an apocalyptic number.
270306481 is the 16441-st square number.
270306481 is the 8221-st centered octagonal number.
It is an amenable number.
270306481 is a deficient number, since it is larger than the sum of its proper divisors (7446288).
270306481 is an frugal number, since it uses more digits than its factorization.
270306481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 884 (or 442 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 31.
The cubic root of 270306481 is about 646.5748676094.
The spelling of 270306481 in words is "two hundred seventy million, three hundred six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •