Base | Representation |
---|---|
bin | 11000101000011… |
… | …111100100010001 |
3 | 1001210122012110011 |
4 | 120220133210101 |
5 | 1321244040431 |
6 | 105001434521 |
7 | 13145502451 |
oct | 3050374421 |
9 | 1053565404 |
10 | 413268241 |
11 | 1a2308601 |
12 | b649ba41 |
13 | 67808929 |
14 | 3cc59d61 |
15 | 26434cb1 |
hex | 18a1f911 |
413268241 has 9 divisors (see below), whose sum is σ = 428621713. Its totient is φ = 398448400.
The previous prime is 413268173. The next prime is 413268269. The reversal of 413268241 is 142862314.
The square root of 413268241 is 20329.
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 71757841 + 341510400 = 8471^2 + 18480^2 .
It is not a de Polignac number, because 413268241 - 211 = 413266193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (413268341) 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 8 ways as a sum of consecutive naturals, for example, 589191 + ... + 589891.
Almost surely, 2413268241 is an apocalyptic number.
413268241 is the 20329-th square number.
413268241 is the 10165-th centered octagonal number.
It is an amenable number.
413268241 is a deficient number, since it is larger than the sum of its proper divisors (15353472).
413268241 is an frugal number, since it uses more digits than its factorization.
413268241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1460 (or 730 counting only the distinct ones).
The product of its digits is 9216, while the sum is 31.
The cubic root of 413268241 is about 744.8646157305.
Multiplying 413268241 by its product of digits (9216), we get a square (3808680109056 = 19515842).
The spelling of 413268241 in words is "four hundred thirteen million, two hundred sixty-eight thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •