Base | Representation |
---|---|
bin | 101101011110011101110101… |
… | …0001000011001011011110100 |
3 | 1221110022201101002100201210110 |
4 | 1122330323222020121123310 |
5 | 404412241333011344130 |
6 | 3534430412250223020 |
7 | 150153604460104626 |
oct | 13274735210313364 |
9 | 1843281332321713 |
10 | 400011412215540 |
11 | 106501983a13094 |
12 | 38a44a84724a70 |
13 | 14227bb69a2b08 |
14 | 70ac92717cc16 |
15 | 313a334e95ab0 |
hex | 16bceea2196f4 |
400011412215540 has 48 divisors (see below), whose sum is σ = 1125717395628672. Its totient is φ = 106128239312256.
The previous prime is 400011412215497. The next prime is 400011412215689. The reversal of 400011412215540 is 45512214110004.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 400011412215498 and 400011412215507.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16920944704 + ... + 16920968343.
It is an arithmetic number, because the mean of its divisors is an integer number (23452445742264).
Almost surely, 2400011412215540 is an apocalyptic number.
It is an amenable number.
400011412215540 is an abundant number, since it is smaller than the sum of its proper divisors (725705983413132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
400011412215540 is a wasteful number, since it uses less digits than its factorization.
400011412215540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33841913256 (or 33841913254 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 30.
Adding to 400011412215540 its reverse (45512214110004), we get a palindrome (445523626325544).
The spelling of 400011412215540 in words is "four hundred trillion, eleven billion, four hundred twelve million, two hundred fifteen thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •