Base | Representation |
---|---|
bin | 100101011111001010… |
… | …001100110101100101 |
3 | 10211220011202120222100 |
4 | 211133022030311211 |
5 | 1124413302341310 |
6 | 30254031122313 |
7 | 2623314453435 |
oct | 453712146545 |
9 | 124804676870 |
10 | 40251215205 |
11 | 16085841813 |
12 | 7974073399 |
13 | 3a4612c106 |
14 | 1d3bac22c5 |
15 | 10a8aaaec0 |
hex | 95f28cd65 |
40251215205 has 48 divisors (see below), whose sum is σ = 73620368640. Its totient is φ = 20303188224.
The previous prime is 40251215201. The next prime is 40251215243. The reversal of 40251215205 is 50251215204.
40251215205 is a `hidden beast` number, since 402 + 51 + 2 + 1 + 5 + 205 = 666.
It is not a de Polignac number, because 40251215205 - 22 = 40251215201 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40251215201) 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 47 ways as a sum of consecutive naturals, for example, 126369 + ... + 310598.
It is an arithmetic number, because the mean of its divisors is an integer number (1533757680).
Almost surely, 240251215205 is an apocalyptic number.
40251215205 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
40251215205 is a deficient number, since it is larger than the sum of its proper divisors (33369153435).
40251215205 is a wasteful number, since it uses less digits than its factorization.
40251215205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437090 (or 437087 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
Subtracting 40251215205 from its reverse (50251215204), we obtain a palindrome (9999999999).
The spelling of 40251215205 in words is "forty billion, two hundred fifty-one million, two hundred fifteen thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •