Base | Representation |
---|---|
bin | 1011101001101101011… |
… | …10010000001010001101 |
3 | 1102021101002020220102221 |
4 | 11310312232100022031 |
5 | 23024404103144010 |
6 | 503530203015341 |
7 | 40632022205500 |
oct | 5646656201215 |
9 | 1367332226387 |
10 | 400350053005 |
11 | 144873193401 |
12 | 6571050a551 |
13 | 2b9a30126b6 |
14 | 1553c885137 |
15 | a6324e2dda |
hex | 5d36b9028d |
400350053005 has 48 divisors (see below), whose sum is σ = 569611848240. Its totient is φ = 269246035968.
The previous prime is 400350052997. The next prime is 400350053029. The reversal of 400350053005 is 500350053004.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 90049806889 + 310300246116 = 300083^2 + 557046^2 .
It is not a de Polignac number, because 400350053005 - 23 = 400350052997 is a prime.
It is a super-2 number, since 2×4003500530052 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 56312391 + ... + 56319499.
It is an arithmetic number, because the mean of its divisors is an integer number (11866913505).
Almost surely, 2400350053005 is an apocalyptic number.
It is an amenable number.
400350053005 is a deficient number, since it is larger than the sum of its proper divisors (169261795235).
400350053005 is a wasteful number, since it uses less digits than its factorization.
400350053005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11518 (or 11511 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 25.
Subtracting 400350053005 from its reverse (500350053004), we obtain a palindrome (99999999999).
The spelling of 400350053005 in words is "four hundred billion, three hundred fifty million, fifty-three thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •