Base | Representation |
---|---|
bin | 1011110001110110111… |
… | …01010100010111000101 |
3 | 1102200122221111011112022 |
4 | 11320323131110113011 |
5 | 23112333430422031 |
6 | 505532225532525 |
7 | 41145310131461 |
oct | 5707335242705 |
9 | 1380587434468 |
10 | 404724467141 |
11 | 1467084574a5 |
12 | 665314a4145 |
13 | 2c21c387927 |
14 | 1583581d4a1 |
15 | a7db57597b |
hex | 5e3b7545c5 |
404724467141 has 8 divisors (see below), whose sum is σ = 405348766584. Its totient is φ = 404100365760.
The previous prime is 404724467137. The next prime is 404724467179. The reversal of 404724467141 is 141764427404.
It can be written as a sum of positive squares in 4 ways, for example, as 134788108225 + 269936358916 = 367135^2 + 519554^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 404724467141 - 22 = 404724467137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 404724467092 and 404724467101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404724467111) 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, 4337915 + ... + 4430231.
It is an arithmetic number, because the mean of its divisors is an integer number (50668595823).
Almost surely, 2404724467141 is an apocalyptic number.
It is an amenable number.
404724467141 is a deficient number, since it is larger than the sum of its proper divisors (624299443).
404724467141 is an equidigital number, since it uses as much as digits as its factorization.
404724467141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99031.
The product of its (nonzero) digits is 602112, while the sum is 44.
The spelling of 404724467141 in words is "four hundred four billion, seven hundred twenty-four million, four hundred sixty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •