Base | Representation |
---|---|
bin | 1100110100100001000… |
… | …01101010111111001001 |
3 | 1120010000222221020021220 |
4 | 12122100201222333021 |
5 | 24204131410110441 |
6 | 534211304152253 |
7 | 43553166130266 |
oct | 6322041527711 |
9 | 1503028836256 |
10 | 440511410121 |
11 | 15a902230432 |
12 | 7145a468689 |
13 | 3270363c333 |
14 | 1746c65626d |
15 | b6d324e466 |
hex | 669086afc9 |
440511410121 has 64 divisors (see below), whose sum is σ = 639838617600. Its totient is φ = 268728093504.
The previous prime is 440511410107. The next prime is 440511410137. The reversal of 440511410121 is 121014115044.
It is a happy number.
It is not a de Polignac number, because 440511410121 - 26 = 440511410057 is a prime.
It is a super-2 number, since 2×4405114101212 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 440511410091 and 440511410100.
It is not an unprimeable number, because it can be changed into a prime (440511410191) 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 in 63 ways as a sum of consecutive naturals, for example, 38490426 + ... + 38501868.
It is an arithmetic number, because the mean of its divisors is an integer number (9997478400).
Almost surely, 2440511410121 is an apocalyptic number.
It is an amenable number.
440511410121 is a deficient number, since it is larger than the sum of its proper divisors (199327207479).
440511410121 is a wasteful number, since it uses less digits than its factorization.
440511410121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11730.
The product of its (nonzero) digits is 640, while the sum is 24.
Adding to 440511410121 its reverse (121014115044), we get a palindrome (561525525165).
The spelling of 440511410121 in words is "four hundred forty billion, five hundred eleven million, four hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •