Base | Representation |
---|---|
bin | 1100110100001101001… |
… | …00100101000010010111 |
3 | 1120002121100200020111201 |
4 | 12122012210211002113 |
5 | 24203311131300043 |
6 | 534142540413331 |
7 | 43546100433343 |
oct | 6320644450227 |
9 | 1502540606451 |
10 | 440344400023 |
11 | 15a826a30260 |
12 | 71412547247 |
13 | 326a7b65ba8 |
14 | 174543c0623 |
15 | b6c375ec4d |
hex | 6686925097 |
440344400023 has 8 divisors (see below), whose sum is σ = 480518760960. Its totient is φ = 400193881080.
The previous prime is 440344400021. The next prime is 440344400051. The reversal of 440344400023 is 320004443044.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 440344400023 - 21 = 440344400021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 440344399964 and 440344400000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (440344400021) 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 7 ways as a sum of consecutive naturals, for example, 5921865 + ... + 5995762.
It is an arithmetic number, because the mean of its divisors is an integer number (60064845120).
Almost surely, 2440344400023 is an apocalyptic number.
440344400023 is a deficient number, since it is larger than the sum of its proper divisors (40174360937).
440344400023 is a wasteful number, since it uses less digits than its factorization.
440344400023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11920997.
The product of its (nonzero) digits is 18432, while the sum is 28.
Adding to 440344400023 its reverse (320004443044), we get a palindrome (760348843067).
The spelling of 440344400023 in words is "four hundred forty billion, three hundred forty-four million, four hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •