Base | Representation |
---|---|
bin | 101101111011110010010100… |
… | …0000011001001110111111001 |
3 | 1221222120221210001222012011211 |
4 | 1123313210220003021313321 |
5 | 410424302213332231441 |
6 | 3551153533255123121 |
7 | 151051002603105463 |
oct | 13367445003116771 |
9 | 1858527701865154 |
10 | 404041130352121 |
11 | 107815976831609 |
12 | 39395a650734a1 |
13 | 1445abb8645a42 |
14 | 71ab9a3315133 |
15 | 31aa084e4ea81 |
hex | 16f79280c9df9 |
404041130352121 has 8 divisors (see below), whose sum is σ = 407462498546688. Its totient is φ = 400633366008000.
The previous prime is 404041130352073. The next prime is 404041130352137. The reversal of 404041130352121 is 121253031140404.
It is a happy number.
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 404041130352121 - 247 = 263303641996793 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (404041130352151) 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, 3400902960 + ... + 3401021761.
It is an arithmetic number, because the mean of its divisors is an integer number (50932812318336).
Almost surely, 2404041130352121 is an apocalyptic number.
It is an amenable number.
404041130352121 is a deficient number, since it is larger than the sum of its proper divisors (3421368194567).
404041130352121 is a wasteful number, since it uses less digits than its factorization.
404041130352121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6801925223.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 404041130352121 its reverse (121253031140404), we get a palindrome (525294161492525).
The spelling of 404041130352121 in words is "four hundred four trillion, forty-one billion, one hundred thirty million, three hundred fifty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •