Base | Representation |
---|---|
bin | 11000001111011… |
… | …011000011001101 |
3 | 1001100021022020001 |
4 | 120033123003031 |
5 | 1313103234031 |
6 | 104204524301 |
7 | 13035601015 |
oct | 3017330315 |
9 | 1040238201 |
10 | 406696141 |
11 | 199629915 |
12 | b4250691 |
13 | 66347407 |
14 | 3c028c45 |
15 | 25a87861 |
hex | 183db0cd |
406696141 has 8 divisors (see below), whose sum is σ = 409316544. Its totient is φ = 404083680.
The previous prime is 406696111. The next prime is 406696163. The reversal of 406696141 is 141696604.
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 406696141 - 213 = 406687949 is a prime.
It is a super-2 number, since 2×4066961412 = 330803502208583762, which contains 22 as substring.
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 406696141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (406696111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 125856 + ... + 129046.
It is an arithmetic number, because the mean of its divisors is an integer number (51164568).
Almost surely, 2406696141 is an apocalyptic number.
It is an amenable number.
406696141 is a deficient number, since it is larger than the sum of its proper divisors (2620403).
406696141 is a wasteful number, since it uses less digits than its factorization.
406696141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3971.
The product of its (nonzero) digits is 31104, while the sum is 37.
The square root of 406696141 is about 20166.7087299837. The cubic root of 406696141 is about 740.8950340104.
The spelling of 406696141 in words is "four hundred six million, six hundred ninety-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •