Base | Representation |
---|---|
bin | 100101101111010111… |
… | …111111000010010001 |
3 | 10212121010200002222000 |
4 | 211233113333002101 |
5 | 1130442423423040 |
6 | 30341030104213 |
7 | 2633130030150 |
oct | 455727770221 |
9 | 125533602860 |
10 | 40523264145 |
11 | 16205365151 |
12 | 7a2b1ab069 |
13 | 3a8a5c1710 |
14 | 1d65c9b597 |
15 | 10c28e8130 |
hex | 96f5ff091 |
40523264145 has 64 divisors (see below), whose sum is σ = 88666314240. Its totient is φ = 17099921664.
The previous prime is 40523264143. The next prime is 40523264153. The reversal of 40523264145 is 54146232504.
40523264145 is a `hidden beast` number, since 4 + 0 + 5 + 2 + 3 + 2 + 641 + 4 + 5 = 666.
It is not a de Polignac number, because 40523264145 - 21 = 40523264143 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (40523264143) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1637014 + ... + 1661583.
It is an arithmetic number, because the mean of its divisors is an integer number (1385411160).
Almost surely, 240523264145 is an apocalyptic number.
40523264145 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
40523264145 is an abundant number, since it is smaller than the sum of its proper divisors (48143050095).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40523264145 is a wasteful number, since it uses less digits than its factorization.
40523264145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3298631 (or 3298625 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 36.
Adding to 40523264145 its reverse (54146232504), we get a palindrome (94669496649).
The spelling of 40523264145 in words is "forty billion, five hundred twenty-three million, two hundred sixty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •