Base | Representation |
---|---|
bin | 11000001000010… |
… | …010100101110001 |
3 | 1001012202022112101 |
4 | 120020102211301 |
5 | 1312113421411 |
6 | 104100500401 |
7 | 13013653063 |
oct | 3010224561 |
9 | 1035668471 |
10 | 404826481 |
11 | 198572144 |
12 | b36aa701 |
13 | 65b413c7 |
14 | 3ba9d733 |
15 | 258188c1 |
hex | 18212971 |
404826481 has 2 divisors, whose sum is σ = 404826482. Its totient is φ = 404826480.
The previous prime is 404826449. The next prime is 404826517. The reversal of 404826481 is 184628404.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 224730081 + 180096400 = 14991^2 + 13420^2 .
It is a cyclic number.
It is not a de Polignac number, because 404826481 - 25 = 404826449 is a prime.
It is a super-2 number, since 2×4048264812 = 327768959437686722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 404826481.
It is not a weakly prime, because it can be changed into another prime (404826431) 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 as a sum of consecutive naturals, namely, 202413240 + 202413241.
It is an arithmetic number, because the mean of its divisors is an integer number (202413241).
Almost surely, 2404826481 is an apocalyptic number.
It is an amenable number.
404826481 is a deficient number, since it is larger than the sum of its proper divisors (1).
404826481 is an equidigital number, since it uses as much as digits as its factorization.
404826481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 49152, while the sum is 37.
The square root of 404826481 is about 20120.3002214182. The cubic root of 404826481 is about 739.7579443281.
The spelling of 404826481 in words is "four hundred four million, eight hundred twenty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •