Base | Representation |
---|---|
bin | 101101100001101001011011… |
… | …1000010000010001100110000 |
3 | 1221111212111221100112110011120 |
4 | 1123003102313002002030300 |
5 | 404441422304220324210 |
6 | 3535403322152542240 |
7 | 150230313434244450 |
oct | 13303226702021460 |
9 | 1844774840473146 |
10 | 400448641573680 |
11 | 106660351548267 |
12 | 38ab57679b1980 |
13 | 1425a1b637524b |
14 | 70c5b6396bd60 |
15 | 31468c4eda270 |
hex | 16c34b7082330 |
400448641573680 has 160 divisors (see below), whose sum is σ = 1464497889374208. Its totient is φ = 88578501350400.
The previous prime is 400448641573657. The next prime is 400448641573681. The reversal of 400448641573680 is 86375146844004.
It is a super-2 number, since 2×4004486415736802 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is not an unprimeable number, because it can be changed into a prime (400448641573681) 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, 3844500931 + ... + 3844605090.
Almost surely, 2400448641573680 is an apocalyptic number.
400448641573680 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
400448641573680 is an abundant number, since it is smaller than the sum of its proper divisors (1064049247800528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
400448641573680 is a wasteful number, since it uses less digits than its factorization.
400448641573680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7689106075 (or 7689106069 counting only the distinct ones).
The product of its (nonzero) digits is 61931520, while the sum is 60.
The spelling of 400448641573680 in words is "four hundred trillion, four hundred forty-eight billion, six hundred forty-one million, five hundred seventy-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •