Base | Representation |
---|---|
bin | 1100110011111101100… |
… | …11011011001100010011 |
3 | 1120002021021102222222211 |
4 | 12121332303123030103 |
5 | 24203024300333011 |
6 | 534122003212551 |
7 | 43542625614436 |
oct | 6317663331423 |
9 | 1502237388884 |
10 | 440214074131 |
11 | 15a76a406507 |
12 | 71396977157 |
13 | 32686b64c90 |
14 | 17440d7781d |
15 | b6b70b9b21 |
hex | 667ecdb313 |
440214074131 has 16 divisors (see below), whose sum is σ = 483355524960. Its totient is φ = 398408774400.
The previous prime is 440214074107. The next prime is 440214074149. The reversal of 440214074131 is 131470412044.
It is a happy number.
It is not a de Polignac number, because 440214074131 - 25 = 440214074099 is a prime.
It is a super-2 number, since 2×4402140741312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 440214074093 and 440214074102.
It is not an unprimeable number, because it can be changed into a prime (440214074831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 779575 + ... + 1219903.
It is an arithmetic number, because the mean of its divisors is an integer number (30209720310).
Almost surely, 2440214074131 is an apocalyptic number.
440214074131 is a deficient number, since it is larger than the sum of its proper divisors (43141450829).
440214074131 is a wasteful number, since it uses less digits than its factorization.
440214074131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441846.
The product of its (nonzero) digits is 10752, while the sum is 31.
Adding to 440214074131 its reverse (131470412044), we get a palindrome (571684486175).
The spelling of 440214074131 in words is "four hundred forty billion, two hundred fourteen million, seventy-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •