Base | Representation |
---|---|
bin | 1001100110010… |
… | …1001001100111 |
3 | 2210202102121111 |
4 | 2121211021213 |
5 | 40301311244 |
6 | 3554525451 |
7 | 666130450 |
oct | 231451147 |
9 | 83672544 |
10 | 40260199 |
11 | 207a90a1 |
12 | 11596887 |
13 | 8458105 |
14 | 54c0127 |
15 | 3803e34 |
hex | 2665267 |
40260199 has 8 divisors (see below), whose sum is σ = 48718368. Its totient is φ = 32478720.
The previous prime is 40260191. The next prime is 40260203. The reversal of 40260199 is 99106204.
It is a happy number.
40260199 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40260199 - 23 = 40260191 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 40260199.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40260191) 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 7 ways as a sum of consecutive naturals, for example, 169042 + ... + 169279.
It is an arithmetic number, because the mean of its divisors is an integer number (6089796).
Almost surely, 240260199 is an apocalyptic number.
40260199 is a deficient number, since it is larger than the sum of its proper divisors (8458169).
40260199 is a wasteful number, since it uses less digits than its factorization.
40260199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338345.
The product of its (nonzero) digits is 3888, while the sum is 31.
The square root of 40260199 is about 6345.0925131159. The cubic root of 40260199 is about 342.7351439041.
The spelling of 40260199 in words is "forty million, two hundred sixty thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •