Base | Representation |
---|---|
bin | 1011110001110000000… |
… | …00110100110110100100 |
3 | 1102200111220201120211021 |
4 | 11320320000310312210 |
5 | 23112224131311104 |
6 | 505522403020524 |
7 | 41144005624300 |
oct | 5707000646644 |
9 | 1380456646737 |
10 | 404666666404 |
11 | 1466888689a0 |
12 | 6651606a744 |
13 | 2c2103caa00 |
14 | 1582bc94d00 |
15 | a7d6459754 |
hex | 5e38034da4 |
404666666404 has 108 divisors (see below), whose sum is σ = 973122676848. Its totient is φ = 145534334400.
The previous prime is 404666666399. The next prime is 404666666429.
It is a happy number.
404666666404 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×4046666664042 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 190942 + ... + 919669.
It is an arithmetic number, because the mean of its divisors is an integer number (9010395156).
Almost surely, 2404666666404 is an apocalyptic number.
404666666404 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
404666666404 is an abundant number, since it is smaller than the sum of its proper divisors (568456010444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
404666666404 is a wasteful number, since it uses less digits than its factorization.
404666666404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1110666 (or 1110644 counting only the distinct ones).
The product of its (nonzero) digits is 11943936, while the sum is 52.
The spelling of 404666666404 in words is "four hundred four billion, six hundred sixty-six million, six hundred sixty-six thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •