Base | Representation |
---|---|
bin | 1001101011001… |
… | …0100111101000 |
3 | 2211100112212211 |
4 | 2122302213220 |
5 | 40341440022 |
6 | 4005414504 |
7 | 1001621533 |
oct | 232624750 |
9 | 84315784 |
10 | 40577512 |
11 | 209a5538 |
12 | 1170a434 |
13 | 8539681 |
14 | 5563a1a |
15 | 3867e77 |
hex | 26b29e8 |
40577512 has 32 divisors (see below), whose sum is σ = 79200000. Its totient is φ = 19468800.
The previous prime is 40577507. The next prime is 40577519. The reversal of 40577512 is 21577504.
40577512 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×405775122 = 3293068960220288, which contains 22 as substring.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is not an unprimeable number, because it can be changed into a prime (40577519) 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, 31864 + ... + 33112.
It is an arithmetic number, because the mean of its divisors is an integer number (2475000).
Almost surely, 240577512 is an apocalyptic number.
It is an amenable number.
40577512 is a deficient number, since it is larger than the sum of its proper divisors (38622488).
40577512 is a wasteful number, since it uses less digits than its factorization.
40577512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1417 (or 1413 counting only the distinct ones).
The product of its (nonzero) digits is 9800, while the sum is 31.
The square root of 40577512 is about 6370.0480374955. The cubic root of 40577512 is about 343.6332173215.
The spelling of 40577512 in words is "forty million, five hundred seventy-seven thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •