Base | Representation |
---|---|
bin | 1011110000101111000… |
… | …00000111111111110000 |
3 | 1102122002220101012100100 |
4 | 11320113200013333300 |
5 | 23110120013120102 |
6 | 505352320152400 |
7 | 41124333501603 |
oct | 5702740077760 |
9 | 1378086335310 |
10 | 404121223152 |
11 | 146428993349 |
12 | 663a3468700 |
13 | 2c1543c461a |
14 | 157b967033a |
15 | a7a3616a1c |
hex | 5e17807ff0 |
404121223152 has 120 divisors (see below), whose sum is σ = 1197769860144. Its totient is φ = 126755223552.
The previous prime is 404121223151. The next prime is 404121223193. The reversal of 404121223152 is 251322121404.
404121223152 is a `hidden beast` number, since 4 + 0 + 412 + 12 + 231 + 5 + 2 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404121223151) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13015198 + ... + 13046210.
Almost surely, 2404121223152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 404121223152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (598884930072).
404121223152 is an abundant number, since it is smaller than the sum of its proper divisors (793648636992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
404121223152 is a wasteful number, since it uses less digits than its factorization.
404121223152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36367 (or 36358 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 404121223152 its reverse (251322121404), we get a palindrome (655443344556).
The spelling of 404121223152 in words is "four hundred four billion, one hundred twenty-one million, two hundred twenty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •