Base | Representation |
---|---|
bin | 101000111111… |
… | …011011100000 |
3 | 202012221011000 |
4 | 220333123200 |
5 | 10222324233 |
6 | 1022152000 |
7 | 160223121 |
oct | 50773340 |
9 | 22187130 |
10 | 10745568 |
11 | 607a339 |
12 | 3722600 |
13 | 22c3032 |
14 | 15da048 |
15 | e23d13 |
hex | a3f6e0 |
10745568 has 48 divisors (see below), whose sum is σ = 31343760. Its totient is φ = 3581568.
The previous prime is 10745543. The next prime is 10745587. The reversal of 10745568 is 86554701.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Smith number, since the sum of its digits (36) 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 (36).
It is a congruent number.
It is an unprimeable number.
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, 5355 + ... + 7082.
It is an arithmetic number, because the mean of its divisors is an integer number (652995).
Almost surely, 210745568 is an apocalyptic number.
10745568 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
10745568 is an abundant number, since it is smaller than the sum of its proper divisors (20598192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10745568 is a wasteful number, since it uses less digits than its factorization.
10745568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12456 (or 12442 counting only the distinct ones).
The product of its (nonzero) digits is 33600, while the sum is 36.
The square root of 10745568 is about 3278.0433188108. The cubic root of 10745568 is about 220.6699139220.
The spelling of 10745568 in words is "ten million, seven hundred forty-five thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •