Base | Representation |
---|---|
bin | 101001000000… |
… | …000000000000 |
3 | 202020001100112 |
4 | 221000000000 |
5 | 10222413104 |
6 | 1022210452 |
7 | 160232666 |
oct | 51000000 |
9 | 22201315 |
10 | 10747904 |
11 | 6081072 |
12 | 3723a28 |
13 | 22c410b |
14 | 15dac36 |
15 | e2486e |
hex | a40000 |
10747904 has 38 divisors (see below), whose sum is σ = 22020054. Its totient is φ = 5242880.
The previous prime is 10747903. The next prime is 10747921. The reversal of 10747904 is 40974701.
It can be written as a sum of positive squares in only one way, i.e., 6553600 + 4194304 = 2560^2 + 2048^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a nialpdrome in base 4, base 8 and base 16.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10747903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (3) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 262124 + ... + 262164.
Almost surely, 210747904 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10747904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11010027).
10747904 is an abundant number, since it is smaller than the sum of its proper divisors (11272150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10747904 is an frugal number, since it uses more digits than its factorization.
10747904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77 (or 43 counting only the distinct ones).
The product of its (nonzero) digits is 7056, while the sum is 32.
The square root of 10747904 is about 3278.3996095656. The cubic root of 10747904 is about 220.6859033845.
The spelling of 10747904 in words is "ten million, seven hundred forty-seven thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •