Base | Representation |
---|---|
bin | 1001100101011… |
… | …1000000111101 |
3 | 2210122111012010 |
4 | 2121113000331 |
5 | 40242433201 |
6 | 3553401433 |
7 | 665466606 |
oct | 231270075 |
9 | 83574163 |
10 | 40202301 |
11 | 20769647 |
12 | 11569279 |
13 | 8437959 |
14 | 54a6dad |
15 | 37e1bd6 |
hex | 265703d |
40202301 has 4 divisors (see below), whose sum is σ = 53603072. Its totient is φ = 26801532.
The previous prime is 40202299. The next prime is 40202311. The reversal of 40202301 is 10320204.
40202301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 40202301 - 21 = 40202299 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40202311) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 6700381 + ... + 6700386.
It is an arithmetic number, because the mean of its divisors is an integer number (13400768).
Almost surely, 240202301 is an apocalyptic number.
It is an amenable number.
40202301 is a deficient number, since it is larger than the sum of its proper divisors (13400771).
40202301 is a wasteful number, since it uses less digits than its factorization.
40202301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13400770.
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 40202301 is about 6340.5284480081. The cubic root of 40202301 is about 342.5707698256.
Adding to 40202301 its reverse (10320204), we get a palindrome (50522505).
The spelling of 40202301 in words is "forty million, two hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.203 sec. • engine limits •