Base | Representation |
---|---|
bin | 1001101011000… |
… | …0111011001001 |
3 | 2211100012100200 |
4 | 2122300323021 |
5 | 40341224234 |
6 | 4005322413 |
7 | 1001562354 |
oct | 232607311 |
9 | 84305320 |
10 | 40570569 |
11 | 209a02a6 |
12 | 11706409 |
13 | 8536470 |
14 | 556129b |
15 | 3865d99 |
hex | 26b0ec9 |
40570569 has 24 divisors (see below), whose sum is σ = 63615552. Its totient is φ = 24766560.
The previous prime is 40570511. The next prime is 40570573. The reversal of 40570569 is 96507504.
40570569 is a `hidden beast` number, since 40 + 57 + 0 + 569 = 666.
40570569 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 40570569 - 212 = 40566473 is a prime.
It is a super-3 number, since 3×405705693 (a number of 24 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (40570669) 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 23 ways as a sum of consecutive naturals, for example, 14004 + ... + 16650.
It is an arithmetic number, because the mean of its divisors is an integer number (2650648).
Almost surely, 240570569 is an apocalyptic number.
It is an amenable number.
40570569 is a deficient number, since it is larger than the sum of its proper divisors (23044983).
40570569 is a wasteful number, since it uses less digits than its factorization.
40570569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2797 (or 2794 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 36.
The square root of 40570569 is about 6369.5030418393. The cubic root of 40570569 is about 343.6136171259.
The spelling of 40570569 in words is "forty million, five hundred seventy thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •