Base | Representation |
---|---|
bin | 1001101011000… |
… | …0111011001100 |
3 | 2211100012100210 |
4 | 2122300323030 |
5 | 40341224242 |
6 | 4005322420 |
7 | 1001562360 |
oct | 232607314 |
9 | 84305323 |
10 | 40570572 |
11 | 209a02a9 |
12 | 11706410 |
13 | 8536473 |
14 | 55612a0 |
15 | 3865d9c |
hex | 26b0ecc |
40570572 has 48 divisors (see below), whose sum is σ = 108605952. Its totient is φ = 11546880.
The previous prime is 40570511. The next prime is 40570573. The reversal of 40570572 is 27507504.
40570572 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-3 number, since 3×405705723 (a number of 24 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (40570573) 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 15 ways as a sum of consecutive naturals, for example, 25348 + ... + 26900.
It is an arithmetic number, because the mean of its divisors is an integer number (2262624).
Almost surely, 240570572 is an apocalyptic number.
40570572 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
40570572 is an abundant number, since it is smaller than the sum of its proper divisors (68035380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40570572 is a wasteful number, since it uses less digits than its factorization.
40570572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1878 (or 1876 counting only the distinct ones).
The product of its (nonzero) digits is 9800, while the sum is 30.
The square root of 40570572 is about 6369.5032773365. The cubic root of 40570572 is about 343.6136255954.
The spelling of 40570572 in words is "forty million, five hundred seventy thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •