Base | Representation |
---|---|
bin | 10010010101100110001011… |
… | …11100101010000110101101 |
3 | 12021202222111220222102101010 |
4 | 21022303011330222012231 |
5 | 20241134010320100001 |
6 | 221432450235535433 |
7 | 11331230025323334 |
oct | 1112630574520655 |
9 | 167688456872333 |
10 | 40324473987501 |
11 | 11937571344420 |
12 | 46331a08ba579 |
13 | 196677396a782 |
14 | 9d5a01b9ad1b |
15 | 49ddeace78d6 |
hex | 24acc5f2a1ad |
40324473987501 has 16 divisors (see below), whose sum is σ = 58654211056128. Its totient is φ = 24438895681200.
The previous prime is 40324473987451. The next prime is 40324473987509. The reversal of 40324473987501 is 10578937442304.
40324473987501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 40324473987501 - 219 = 40324473463213 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 (40324473987509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 146850 + ... + 8981676.
It is an arithmetic number, because the mean of its divisors is an integer number (3665888191008).
Almost surely, 240324473987501 is an apocalyptic number.
It is an amenable number.
40324473987501 is a deficient number, since it is larger than the sum of its proper divisors (18329737068627).
40324473987501 is a wasteful number, since it uses less digits than its factorization.
40324473987501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8973152.
The product of its (nonzero) digits is 20321280, while the sum is 57.
The spelling of 40324473987501 in words is "forty trillion, three hundred twenty-four billion, four hundred seventy-three million, nine hundred eighty-seven thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •