Base | Representation |
---|---|
bin | 1011110001101111111… |
… | …10011101001010111000 |
3 | 1102200111212120000120110 |
4 | 11320313332131022320 |
5 | 23112224001420422 |
6 | 505522341424320 |
7 | 41144000426040 |
oct | 5706776351270 |
9 | 1380455500513 |
10 | 404666045112 |
11 | 14668848412a |
12 | 66515a0b0a0 |
13 | 2c210240c94 |
14 | 1582bb72720 |
15 | a7d638560c |
hex | 5e37f9d2b8 |
404666045112 has 128 divisors (see below), whose sum is σ = 1175518333440. Its totient is φ = 113687124480.
The previous prime is 404666045111. The next prime is 404666045123. The reversal of 404666045112 is 211540666404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404666045111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 58584363 + ... + 58591269.
It is an arithmetic number, because the mean of its divisors is an integer number (9183736980).
Almost surely, 2404666045112 is an apocalyptic number.
404666045112 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 404666045112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (587759166720).
404666045112 is an abundant number, since it is smaller than the sum of its proper divisors (770852288328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
404666045112 is a wasteful number, since it uses less digits than its factorization.
404666045112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12701 (or 12697 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 39.
The spelling of 404666045112 in words is "four hundred four billion, six hundred sixty-six million, forty-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •