Base | Representation |
---|---|
bin | 100101100011010100… |
… | …100011111101010101 |
3 | 10212002001011001212202 |
4 | 211203110203331111 |
5 | 1130034141241323 |
6 | 30305003454245 |
7 | 2625123121046 |
oct | 454324437525 |
9 | 125061131782 |
10 | 40321040213 |
11 | 161111a3333 |
12 | 7993527385 |
13 | 3a5773909c |
14 | 1d4709a8cd |
15 | 10aec9ed28 |
hex | 963523f55 |
40321040213 has 4 divisors (see below), whose sum is σ = 41711420940. Its totient is φ = 38930659488.
The previous prime is 40321040203. The next prime is 40321040239. The reversal of 40321040213 is 31204012304.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 21363330244 + 18957709969 = 146162^2 + 137687^2 .
It is a cyclic number.
It is not a de Polignac number, because 40321040213 - 212 = 40321036117 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40321040203) 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 3 ways as a sum of consecutive naturals, for example, 695190320 + ... + 695190377.
It is an arithmetic number, because the mean of its divisors is an integer number (10427855235).
Almost surely, 240321040213 is an apocalyptic number.
It is an amenable number.
40321040213 is a deficient number, since it is larger than the sum of its proper divisors (1390380727).
40321040213 is a wasteful number, since it uses less digits than its factorization.
40321040213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1390380726.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 40321040213 its reverse (31204012304), we get a palindrome (71525052517).
The spelling of 40321040213 in words is "forty billion, three hundred twenty-one million, forty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •