Base | Representation |
---|---|
bin | 1011101001101100110… |
… | …11000110011010001011 |
3 | 1102021100201210211101001 |
4 | 11310312123012122023 |
5 | 23024401312013311 |
6 | 503525503235431 |
7 | 40631631425116 |
oct | 5646633063213 |
9 | 1367321724331 |
10 | 400345032331 |
11 | 144870374292 |
12 | 6570a8a8b77 |
13 | 2b9a1c7539a |
14 | 1553bd3957d |
15 | a631d504c1 |
hex | 5d366c668b |
400345032331 has 4 divisors (see below), whose sum is σ = 400811092600. Its totient is φ = 399878972064.
The previous prime is 400345032293. The next prime is 400345032343. The reversal of 400345032331 is 133230543004.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 400345032331 - 27 = 400345032203 is a prime.
It is a super-2 number, since 2×4003450323312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 400345032331.
It is not an unprimeable number, because it can be changed into a prime (400345032391) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 233028846 + ... + 233030563.
It is an arithmetic number, because the mean of its divisors is an integer number (100202773150).
Almost surely, 2400345032331 is an apocalyptic number.
400345032331 is a deficient number, since it is larger than the sum of its proper divisors (466060269).
400345032331 is an equidigital number, since it uses as much as digits as its factorization.
400345032331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466060268.
The product of its (nonzero) digits is 12960, while the sum is 28.
Adding to 400345032331 its reverse (133230543004), we get a palindrome (533575575335).
The spelling of 400345032331 in words is "four hundred billion, three hundred forty-five million, thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •