Base | Representation |
---|---|
bin | 1001100100010… |
… | …0001001010111 |
3 | 2210111120011200 |
4 | 2121010021113 |
5 | 40233000030 |
6 | 3552003543 |
7 | 665025360 |
oct | 231041127 |
9 | 83446150 |
10 | 40125015 |
11 | 20716577 |
12 | 115305b3 |
13 | 840b718 |
14 | 5486b67 |
15 | 37c8d60 |
hex | 2644257 |
40125015 has 96 divisors (see below), whose sum is σ = 86261760. Its totient is φ = 16837632.
The previous prime is 40124963. The next prime is 40125023. The reversal of 40125015 is 51052104.
40125015 is a `hidden beast` number, since 401 + 250 + 15 = 666.
It is not a de Polignac number, because 40125015 - 214 = 40108631 is a prime.
It is a super-2 number, since 2×401250152 = 3220033657500450, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 315882 + ... + 316008.
It is an arithmetic number, because the mean of its divisors is an integer number (898560).
Almost surely, 240125015 is an apocalyptic number.
40125015 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
40125015 is an abundant number, since it is smaller than the sum of its proper divisors (46136745).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40125015 is a wasteful number, since it uses less digits than its factorization.
40125015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221 (or 218 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 18.
The square root of 40125015 is about 6334.4309136654. The cubic root of 40125015 is about 342.3511065392.
Adding to 40125015 its reverse (51052104), we get a palindrome (91177119).
The spelling of 40125015 in words is "forty million, one hundred twenty-five thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •