Base | Representation |
---|---|
bin | 100101101111011111… |
… | …110001010111011001 |
3 | 10212121021111210220112 |
4 | 211233133301113121 |
5 | 1130443434232210 |
6 | 30341141534105 |
7 | 2633153261102 |
oct | 455737612731 |
9 | 125537453815 |
10 | 40525305305 |
11 | 16206529761 |
12 | 7a2ba14335 |
13 | 3a8ab577c4 |
14 | 1d6626d3a9 |
15 | 10c2b9cd05 |
hex | 96f7f15d9 |
40525305305 has 8 divisors (see below), whose sum is σ = 48645038400. Its totient is φ = 32410462896.
The previous prime is 40525305281. The next prime is 40525305329. The reversal of 40525305305 is 50350352504.
It is an interprime number because it is at equal distance from previous prime (40525305281) and next prime (40525305329).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40525305305 - 232 = 36230338009 is a prime.
It is a super-2 number, since 2×405253053052 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1204415 + ... + 1237604.
It is an arithmetic number, because the mean of its divisors is an integer number (6080629800).
Almost surely, 240525305305 is an apocalyptic number.
It is an amenable number.
40525305305 is a deficient number, since it is larger than the sum of its proper divisors (8119733095).
40525305305 is a wasteful number, since it uses less digits than its factorization.
40525305305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2445343.
The product of its (nonzero) digits is 45000, while the sum is 32.
Adding to 40525305305 its reverse (50350352504), we get a palindrome (90875657809).
The spelling of 40525305305 in words is "forty billion, five hundred twenty-five million, three hundred five thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •