Base | Representation |
---|---|
bin | 1011101001111000101… |
… | …10010100111100011001 |
3 | 1102021121122212111011001 |
4 | 11310330112110330121 |
5 | 23030102234210231 |
6 | 503543414105001 |
7 | 40634246421256 |
oct | 5647426247431 |
9 | 1367548774131 |
10 | 400444444441 |
11 | 1449114a4058 |
12 | 6573804b161 |
13 | 2b9b9741412 |
14 | 1554b21642d |
15 | a63a93ab61 |
hex | 5d3c594f19 |
400444444441 has 2 divisors, whose sum is σ = 400444444442. Its totient is φ = 400444444440.
The previous prime is 400444444423. The next prime is 400444444453. The reversal of 400444444441 is 144444444004.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 242812417600 + 157632026841 = 492760^2 + 397029^2 .
It is a cyclic number.
It is not a de Polignac number, because 400444444441 - 25 = 400444444409 is a prime.
It is a super-2 number, since 2×4004444444412 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 400444444441.
It is not a weakly prime, because it can be changed into another prime (400444444481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200222222220 + 200222222221.
It is an arithmetic number, because the mean of its divisors is an integer number (200222222221).
Almost surely, 2400444444441 is an apocalyptic number.
It is an amenable number.
400444444441 is a deficient number, since it is larger than the sum of its proper divisors (1).
400444444441 is an equidigital number, since it uses as much as digits as its factorization.
400444444441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 262144, while the sum is 37.
Adding to 400444444441 its reverse (144444444004), we get a palindrome (544888888445).
The spelling of 400444444441 in words is "four hundred billion, four hundred forty-four million, four hundred forty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •