Base | Representation |
---|---|
bin | 10111011100001… |
… | …100110101010001 |
3 | 1000102000010001021 |
4 | 113130030311101 |
5 | 1301134043221 |
6 | 103005035441 |
7 | 12513504400 |
oct | 2734146521 |
9 | 1012003037 |
10 | 393268561 |
11 | 191a98544 |
12 | ab855b81 |
13 | 636256ba |
14 | 3a331637 |
15 | 247d4041 |
hex | 1770cd51 |
393268561 has 9 divisors (see below), whose sum is σ = 457637211. Its totient is φ = 336968352.
The previous prime is 393268541. The next prime is 393268619. The reversal of 393268561 is 165862393.
The square root of 393268561 is 19831.
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., 154380625 + 238887936 = 12425^2 + 15456^2 .
It is not a de Polignac number, because 393268561 - 25 = 393268529 is a prime.
It is a super-2 number, since 2×3932685612 = 309320322142021442, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (393268541) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 137401 + ... + 140233.
It is an arithmetic number, because the mean of its divisors is an integer number (50848579).
Almost surely, 2393268561 is an apocalyptic number.
393268561 is the 19831-st square number.
393268561 is the 9916-th centered octagonal number.
It is an amenable number.
393268561 is a deficient number, since it is larger than the sum of its proper divisors (64368650).
393268561 is an frugal number, since it uses more digits than its factorization.
393268561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5680 (or 2840 counting only the distinct ones).
The product of its digits is 233280, while the sum is 43.
The cubic root of 393268561 is about 732.6497566429.
The spelling of 393268561 in words is "three hundred ninety-three million, two hundred sixty-eight thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •