Base | Representation |
---|---|
bin | 1001101100101… |
… | …0101010100000 |
3 | 2211112112222112 |
4 | 2123022222200 |
5 | 40403113000 |
6 | 4011454452 |
7 | 1002511631 |
oct | 233125240 |
9 | 84475875 |
10 | 40676000 |
11 | 20a62532 |
12 | 11757428 |
13 | 8572451 |
14 | 558b888 |
15 | 3887235 |
hex | 26caaa0 |
40676000 has 48 divisors (see below), whose sum is σ = 99950760. Its totient is φ = 16268800.
The previous prime is 40675997. The next prime is 40676003. The reversal of 40676000 is 67604.
It is an interprime number because it is at equal distance from previous prime (40675997) and next prime (40676003).
It can be written as a sum of positive squares in 4 ways, for example, as 22391824 + 18284176 = 4732^2 + 4276^2 .
It is not an unprimeable number, because it can be changed into a prime (40676003) 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 7 ways as a sum of consecutive naturals, for example, 1085 + ... + 9084.
Almost surely, 240676000 is an apocalyptic number.
40676000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
40676000 is an abundant number, since it is smaller than the sum of its proper divisors (59274760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40676000 is a wasteful number, since it uses less digits than its factorization.
40676000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10194 (or 10176 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 23.
The square root of 40676000 is about 6377.7739063093. The cubic root of 40676000 is about 343.9110099718.
It can be divided in two parts, 40 and 676000, that multiplied together give a square (27040000 = 52002).
The spelling of 40676000 in words is "forty million, six hundred seventy-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •