Base | Representation |
---|---|
bin | 110010000001100100010101… |
… | …0100111001110100000111101 |
3 | 2010200222111211022222120211202 |
4 | 1210003020222213032200331 |
5 | 430133242143241320331 |
6 | 4155502241104425245 |
7 | 161453255426415515 |
oct | 14403105247164075 |
9 | 2120874738876752 |
10 | 440020114401341 |
11 | 118227534308151 |
12 | 41426a1a018225 |
13 | 15b6a946106936 |
14 | 7a931312a8845 |
15 | 35d0dedb62ecb |
hex | 190322a9ce83d |
440020114401341 has 2 divisors, whose sum is σ = 440020114401342. Its totient is φ = 440020114401340.
The previous prime is 440020114401337. The next prime is 440020114401401. The reversal of 440020114401341 is 143104411020044.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 360109298090116 + 79910816311225 = 18976546^2 + 8939285^2 .
It is a cyclic number.
It is not a de Polignac number, because 440020114401341 - 22 = 440020114401337 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (440020114401311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 220010057200670 + 220010057200671.
It is an arithmetic number, because the mean of its divisors is an integer number (220010057200671).
Almost surely, 2440020114401341 is an apocalyptic number.
It is an amenable number.
440020114401341 is a deficient number, since it is larger than the sum of its proper divisors (1).
440020114401341 is an equidigital number, since it uses as much as digits as its factorization.
440020114401341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 440020114401341 its reverse (143104411020044), we get a palindrome (583124525421385).
The spelling of 440020114401341 in words is "four hundred forty trillion, twenty billion, one hundred fourteen million, four hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •