Base | Representation |
---|---|
bin | 100101011101100100… |
… | …000100011010100111 |
3 | 10211211022101101002000 |
4 | 211131210010122213 |
5 | 1124334424121043 |
6 | 30251233220343 |
7 | 2622541054503 |
oct | 453544043247 |
9 | 124738341060 |
10 | 40224442023 |
11 | 16071715717 |
12 | 79671016b3 |
13 | 3a40716aac |
14 | 1d38313303 |
15 | 10a656d2d3 |
hex | 95d9046a7 |
40224442023 has 8 divisors (see below), whose sum is σ = 59591766000. Its totient is φ = 26816294664.
The previous prime is 40224442019. The next prime is 40224442031. The reversal of 40224442023 is 32024442204.
It is not a de Polignac number, because 40224442023 - 22 = 40224442019 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1489794149 = 40224442023 / (4 + 0 + 2 + 2 + 4 + 4 + 4 + 2 + 0 + 2 + 3).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40224443023) 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, 744897048 + ... + 744897101.
It is an arithmetic number, because the mean of its divisors is an integer number (7448970750).
Almost surely, 240224442023 is an apocalyptic number.
40224442023 is a deficient number, since it is larger than the sum of its proper divisors (19367323977).
40224442023 is a wasteful number, since it uses less digits than its factorization.
40224442023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1489794158 (or 1489794152 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 27.
Adding to 40224442023 its reverse (32024442204), we get a palindrome (72248884227).
The spelling of 40224442023 in words is "forty billion, two hundred twenty-four million, four hundred forty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •