Base | Representation |
---|---|
bin | 11111100011100… |
… | …011011111000001 |
3 | 1100220012000120221 |
4 | 133203203133001 |
5 | 2041012222311 |
6 | 124311103041 |
7 | 16055642200 |
oct | 3743433701 |
9 | 1326160527 |
10 | 529414081 |
11 | 2519276a9 |
12 | 129371a81 |
13 | 858b3491 |
14 | 50451237 |
15 | 31728671 |
hex | 1f8e37c1 |
529414081 has 27 divisors (see below), whose sum is σ = 653746851. Its totient is φ = 427415184.
The previous prime is 529414049. The next prime is 529414091. The reversal of 529414081 is 180414925.
It is a happy number.
The square root of 529414081 is 23009.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 481583025 + 47831056 = 21945^2 + 6916^2 .
It is not a de Polignac number, because 529414081 - 25 = 529414049 is a prime.
It is a super-2 number, since 2×5294140812 = 560558538322149122, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (529414091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 3060111 + ... + 3060283.
Almost surely, 2529414081 is an apocalyptic number.
529414081 is the 23009-th square number.
529414081 is the 11505-th centered octagonal number.
It is an amenable number.
529414081 is a deficient number, since it is larger than the sum of its proper divisors (124332770).
529414081 is an equidigital number, since it uses as much as digits as its factorization.
529414081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 398 (or 199 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 34.
The cubic root of 529414081 is about 808.9689064840.
The spelling of 529414081 in words is "five hundred twenty-nine million, four hundred fourteen thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •