Base | Representation |
---|---|
bin | 1011101001011101111… |
… | …10010011011110000101 |
3 | 1102021001000121201102210 |
4 | 11310232332103132011 |
5 | 23024122312340031 |
6 | 503505240254033 |
7 | 40625553144132 |
oct | 5645676233605 |
9 | 1367030551383 |
10 | 400220043141 |
11 | 144806865036 |
12 | 65694a71319 |
13 | 2b9820c2599 |
14 | 155294c1589 |
15 | a625db1746 |
hex | 5d2ef93785 |
400220043141 has 8 divisors (see below), whose sum is σ = 533641197600. Its totient is φ = 266806125392.
The previous prime is 400220043133. The next prime is 400220043169. The reversal of 400220043141 is 141340022004.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 400220043141 - 23 = 400220043133 is a prime.
It is a super-2 number, since 2×4002200431412 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400220043121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1678791 + ... + 1902308.
It is an arithmetic number, because the mean of its divisors is an integer number (66705149700).
Almost surely, 2400220043141 is an apocalyptic number.
It is an amenable number.
400220043141 is a deficient number, since it is larger than the sum of its proper divisors (133421154459).
400220043141 is a wasteful number, since it uses less digits than its factorization.
400220043141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3618355.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 400220043141 its reverse (141340022004), we get a palindrome (541560065145).
The spelling of 400220043141 in words is "four hundred billion, two hundred twenty million, forty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •