Base | Representation |
---|---|
bin | 1001100111000… |
… | …0010101010001 |
3 | 2210211202102212 |
4 | 2121300111101 |
5 | 40304243001 |
6 | 3555521505 |
7 | 666411131 |
oct | 231602521 |
9 | 83752385 |
10 | 40306001 |
11 | 2082a54a |
12 | 115b9295 |
13 | 8472c08 |
14 | 54d2ac1 |
15 | 38127bb |
hex | 2670551 |
40306001 has 4 divisors (see below), whose sum is σ = 40858212. Its totient is φ = 39753792.
The previous prime is 40305953. The next prime is 40306009. The reversal of 40306001 is 10060304.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17648401 + 22657600 = 4201^2 + 4760^2 .
It is a cyclic number.
It is not a de Polignac number, because 40306001 - 214 = 40289617 is a prime.
It is a super-2 number, since 2×403060012 = 3249147433224002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40306009) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 275996 + ... + 276141.
It is an arithmetic number, because the mean of its divisors is an integer number (10214553).
Almost surely, 240306001 is an apocalyptic number.
It is an amenable number.
40306001 is a deficient number, since it is larger than the sum of its proper divisors (552211).
40306001 is an equidigital number, since it uses as much as digits as its factorization.
40306001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552210.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 40306001 is about 6348.7007332209. The cubic root of 40306001 is about 342.8650654833.
Adding to 40306001 its reverse (10060304), we get a palindrome (50366305).
The spelling of 40306001 in words is "forty million, three hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •