Base | Representation |
---|---|
bin | 1001101101111… |
… | …1011011101111 |
3 | 2211200212200022 |
4 | 2123133123233 |
5 | 40413323241 |
6 | 4013352355 |
7 | 1003314641 |
oct | 233373357 |
9 | 84625608 |
10 | 40761071 |
11 | 2101043a |
12 | 117986bb |
13 | 85a20a0 |
14 | 55b0891 |
15 | 38a254b |
hex | 26df6ef |
40761071 has 8 divisors (see below), whose sum is σ = 44017680. Its totient is φ = 37521792.
The previous prime is 40760999. The next prime is 40761089. The reversal of 40761071 is 17016704.
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 40761071 - 210 = 40760047 is a prime.
It is a super-2 number, since 2×407610712 = 3322929818134082, 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 40761071.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40761571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 791 + ... + 9063.
It is an arithmetic number, because the mean of its divisors is an integer number (5502210).
Almost surely, 240761071 is an apocalyptic number.
40761071 is a deficient number, since it is larger than the sum of its proper divisors (3256609).
40761071 is a wasteful number, since it uses less digits than its factorization.
40761071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8665.
The product of its (nonzero) digits is 1176, while the sum is 26.
The square root of 40761071 is about 6384.4397561572. The cubic root of 40761071 is about 344.1505982710.
Adding to 40761071 its reverse (17016704), we get a palindrome (57777775).
The spelling of 40761071 in words is "forty million, seven hundred sixty-one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •