Base | Representation |
---|---|
bin | 10000000111111… |
… | …101101010001101 |
3 | 200212000222211011 |
4 | 100013331222031 |
5 | 1023223214041 |
6 | 42502125221 |
7 | 6463256566 |
oct | 2007755215 |
9 | 625028734 |
10 | 270523021 |
11 | 129780a4a |
12 | 76720811 |
13 | 44079bc2 |
14 | 27cdd16d |
15 | 18b39e81 |
hex | 101fda8d |
270523021 has 8 divisors (see below), whose sum is σ = 278542584. Its totient is φ = 262540800.
The previous prime is 270522997. The next prime is 270523063. The reversal of 270523021 is 120325072.
It can be written as a sum of positive squares in 4 ways, for example, as 199204996 + 71318025 = 14114^2 + 8445^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 270523021 - 219 = 269998733 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 270522983 and 270523001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (270527021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5721 + ... + 23953.
It is an arithmetic number, because the mean of its divisors is an integer number (34817823).
Almost surely, 2270523021 is an apocalyptic number.
It is an amenable number.
270523021 is a deficient number, since it is larger than the sum of its proper divisors (8019563).
270523021 is a wasteful number, since it uses less digits than its factorization.
270523021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18671.
The product of its (nonzero) digits is 840, while the sum is 22.
The square root of 270523021 is about 16447.5840475129. The cubic root of 270523021 is about 646.7474765571.
Adding to 270523021 its reverse (120325072), we get a palindrome (390848093).
The spelling of 270523021 in words is "two hundred seventy million, five hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •