Base | Representation |
---|---|
bin | 1011101001100000110… |
… | …10001011001010000101 |
3 | 1102021002200221021101011 |
4 | 11310300122023022011 |
5 | 23024144444020331 |
6 | 503511500402221 |
7 | 40626264640423 |
oct | 5646032131205 |
9 | 1367080837334 |
10 | 400244126341 |
11 | 144819414104 |
12 | 656a0b46371 |
13 | 2b9870a53b7 |
14 | 1552c790113 |
15 | a62806c3b1 |
hex | 5d3068b285 |
400244126341 has 2 divisors, whose sum is σ = 400244126342. Its totient is φ = 400244126340.
The previous prime is 400244126339. The next prime is 400244126369. The reversal of 400244126341 is 143621442004.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 301477864900 + 98766261441 = 549070^2 + 314271^2 .
It is a cyclic number.
It is not a de Polignac number, because 400244126341 - 21 = 400244126339 is a prime.
Together with 400244126339, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (400242126341) 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 as a sum of consecutive naturals, namely, 200122063170 + 200122063171.
It is an arithmetic number, because the mean of its divisors is an integer number (200122063171).
Almost surely, 2400244126341 is an apocalyptic number.
It is an amenable number.
400244126341 is a deficient number, since it is larger than the sum of its proper divisors (1).
400244126341 is an equidigital number, since it uses as much as digits as its factorization.
400244126341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 400244126341 its reverse (143621442004), we get a palindrome (543865568345).
The spelling of 400244126341 in words is "four hundred billion, two hundred forty-four million, one hundred twenty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •