Base | Representation |
---|---|
bin | 1001100111000… |
… | …0000101110111 |
3 | 2210211201002100 |
4 | 2121300011313 |
5 | 40304230030 |
6 | 3555513143 |
7 | 666405222 |
oct | 231600567 |
9 | 83751070 |
10 | 40305015 |
11 | 20829833 |
12 | 115b87b3 |
13 | 847262a |
14 | 54d25b9 |
15 | 3812360 |
hex | 2670177 |
40305015 has 12 divisors (see below), whose sum is σ = 69862104. Its totient is φ = 21495984.
The previous prime is 40305007. The next prime is 40305043. The reversal of 40305015 is 51050304.
40305015 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 40305015 - 23 = 40305007 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 447789 + ... + 447878.
It is an arithmetic number, because the mean of its divisors is an integer number (5821842).
Almost surely, 240305015 is an apocalyptic number.
40305015 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
40305015 is a deficient number, since it is larger than the sum of its proper divisors (29557089).
40305015 is a wasteful number, since it uses less digits than its factorization.
40305015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 895678 (or 895675 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 18.
The square root of 40305015 is about 6348.6230790621. The cubic root of 40305015 is about 342.8622696406.
Adding to 40305015 its reverse (51050304), we get a palindrome (91355319).
It can be divided in two parts, 4030 and 5015, that added together give a triangular number (9045 = T134).
The spelling of 40305015 in words is "forty million, three hundred five thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •