Base | Representation |
---|---|
bin | 1011110001011011000… |
… | …01000011011000000010 |
3 | 1102200001122100201021120 |
4 | 11320231201003120002 |
5 | 23111344041040442 |
6 | 505453112333110 |
7 | 41136440034420 |
oct | 5705541033002 |
9 | 1380048321246 |
10 | 404490565122 |
11 | 1465a8419446 |
12 | 664870a4196 |
13 | 2c1b2a90577 |
14 | 15812734110 |
15 | a7c5c714ec |
hex | 5e2d843602 |
404490565122 has 64 divisors (see below), whose sum is σ = 934419118080. Its totient is φ = 114335940096.
The previous prime is 404490565103. The next prime is 404490565133. The reversal of 404490565122 is 221565094404.
It is a super-2 number, since 2×4044905651222 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12282963 + ... + 12315849.
It is an arithmetic number, because the mean of its divisors is an integer number (14600298720).
Almost surely, 2404490565122 is an apocalyptic number.
404490565122 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 404490565122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (467209559040).
404490565122 is an abundant number, since it is smaller than the sum of its proper divisors (529928552958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
404490565122 is a wasteful number, since it uses less digits than its factorization.
404490565122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36015.
The product of its (nonzero) digits is 345600, while the sum is 42.
The spelling of 404490565122 in words is "four hundred four billion, four hundred ninety million, five hundred sixty-five thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •