Base | Representation |
---|---|
bin | 1100110100000001000… |
… | …10001110101110000111 |
3 | 1120002100022002201211221 |
4 | 12122000202032232013 |
5 | 24203104214333111 |
6 | 534124521541211 |
7 | 43543430533330 |
oct | 6320042165607 |
9 | 1502308081757 |
10 | 440243121031 |
11 | 15a78484590a |
12 | 713a4644807 |
13 | 3268cb951ac |
14 | 17444b79287 |
15 | b6b9906371 |
hex | 668088eb87 |
440243121031 has 32 divisors (see below), whose sum is σ = 535011840000. Its totient is φ = 354291114240.
The previous prime is 440243120893. The next prime is 440243121037. The reversal of 440243121031 is 130121342044.
It is not a de Polignac number, because 440243121031 - 211 = 440243118983 is a prime.
It is a super-2 number, since 2×4402431210312 (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 = 440243120987 and 440243121005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (440243121037) 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 in 31 ways as a sum of consecutive naturals, for example, 1231995 + ... + 1548643.
It is an arithmetic number, because the mean of its divisors is an integer number (16719120000).
Almost surely, 2440243121031 is an apocalyptic number.
440243121031 is a deficient number, since it is larger than the sum of its proper divisors (94768718969).
440243121031 is a wasteful number, since it uses less digits than its factorization.
440243121031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 316879.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 440243121031 its reverse (130121342044), we get a palindrome (570364463075).
The spelling of 440243121031 in words is "four hundred forty billion, two hundred forty-three million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •