Base | Representation |
---|---|
bin | 1001100101011… |
… | …0101011010001 |
3 | 2210122102021201 |
4 | 2121112223101 |
5 | 40242412123 |
6 | 3553351201 |
7 | 665462554 |
oct | 231265321 |
9 | 83572251 |
10 | 40200913 |
11 | 207685a5 |
12 | 11568501 |
13 | 843712c |
14 | 54a669b |
15 | 37e15ad |
hex | 2656ad1 |
40200913 has 4 divisors (see below), whose sum is σ = 40361328. Its totient is φ = 40040500.
The previous prime is 40200883. The next prime is 40200917. The reversal of 40200913 is 31900204.
40200913 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 a cyclic number.
It is not a de Polignac number, because 40200913 - 213 = 40192721 is a prime.
It is a super-2 number, since 2×402009132 = 3232226812067138, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40200917) 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, 79831 + ... + 80332.
It is an arithmetic number, because the mean of its divisors is an integer number (10090332).
Almost surely, 240200913 is an apocalyptic number.
It is an amenable number.
40200913 is a deficient number, since it is larger than the sum of its proper divisors (160415).
40200913 is a wasteful number, since it uses less digits than its factorization.
40200913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160414.
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 40200913 is about 6340.4189924641. The cubic root of 40200913 is about 342.5668273174.
The spelling of 40200913 in words is "forty million, two hundred thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •