Base | Representation |
---|---|
bin | 11010001111101… |
… | …100101111010111 |
3 | 1010200112201122102 |
4 | 122033230233113 |
5 | 1400210314111 |
6 | 111405352315 |
7 | 13624453421 |
oct | 3217545727 |
9 | 1120481572 |
10 | 440323031 |
11 | 206607235 |
12 | 10356869b |
13 | 702bc195 |
14 | 4269d811 |
15 | 289cb13b |
hex | 1a3ecbd7 |
440323031 has 2 divisors, whose sum is σ = 440323032. Its totient is φ = 440323030.
The previous prime is 440323027. The next prime is 440323033. The reversal of 440323031 is 130323044.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 440323031 - 22 = 440323027 is a prime.
It is a super-2 number, since 2×4403230312 = 387768743258053922, which contains 22 as substring.
Together with 440323033, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 440322994 and 440323012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (440323033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 220161515 + 220161516.
It is an arithmetic number, because the mean of its divisors is an integer number (220161516).
Almost surely, 2440323031 is an apocalyptic number.
440323031 is a deficient number, since it is larger than the sum of its proper divisors (1).
440323031 is an equidigital number, since it uses as much as digits as its factorization.
440323031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 20.
The square root of 440323031 is about 20983.8755000119. The cubic root of 440323031 is about 760.7765786715.
Adding to 440323031 its reverse (130323044), we get a palindrome (570646075).
The spelling of 440323031 in words is "four hundred forty million, three hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •