Base | Representation |
---|---|
bin | 1001101100111… |
… | …1011011100000 |
3 | 2211120112202111 |
4 | 2123033123200 |
5 | 40404224040 |
6 | 4012125104 |
7 | 1002622555 |
oct | 233173340 |
9 | 84515674 |
10 | 40695520 |
11 | 20a76168 |
12 | 11766794 |
13 | 857b2b8 |
14 | 5594a2c |
15 | 388cdea |
hex | 26cf6e0 |
40695520 has 48 divisors (see below), whose sum is σ = 97977600. Its totient is φ = 15967744.
The previous prime is 40695503. The next prime is 40695521. The reversal of 40695520 is 2559604.
It is a super-2 number, since 2×406955202 = 3312250696140800, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40695521) 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, 6081 + ... + 10879.
It is an arithmetic number, because the mean of its divisors is an integer number (2041200).
Almost surely, 240695520 is an apocalyptic number.
40695520 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40695520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48988800).
40695520 is an abundant number, since it is smaller than the sum of its proper divisors (57282080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40695520 is a wasteful number, since it uses less digits than its factorization.
40695520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4867 (or 4859 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
The square root of 40695520 is about 6379.3040372755. The cubic root of 40695520 is about 343.9660143097.
The spelling of 40695520 in words is "forty million, six hundred ninety-five thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •