Base | Representation |
---|---|
bin | 1011101001001000100… |
… | …00101110110000100101 |
3 | 1102020120111110001022020 |
4 | 11310210100232300211 |
5 | 23023240310333013 |
6 | 503435340253353 |
7 | 40621241436042 |
oct | 5644420566045 |
9 | 1366514401266 |
10 | 400040324133 |
11 | 14472437452a |
12 | 65644841259 |
13 | 2b953ab9588 |
14 | 1550d69c1c9 |
15 | a615211623 |
hex | 5d2442ec25 |
400040324133 has 8 divisors (see below), whose sum is σ = 556577842368. Its totient is φ = 255098177664.
The previous prime is 400040324083. The next prime is 400040324147. The reversal of 400040324133 is 331423040004.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 400040324133 - 26 = 400040324069 is a prime.
It is a super-3 number, since 3×4000403241333 (a number of 36 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400040324833) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2898842860 + ... + 2898842997.
It is an arithmetic number, because the mean of its divisors is an integer number (69572230296).
Almost surely, 2400040324133 is an apocalyptic number.
It is an amenable number.
400040324133 is a deficient number, since it is larger than the sum of its proper divisors (156537518235).
400040324133 is a wasteful number, since it uses less digits than its factorization.
400040324133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5797685883.
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 400040324133 its reverse (331423040004), we get a palindrome (731463364137).
The spelling of 400040324133 in words is "four hundred billion, forty million, three hundred twenty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •