Base | Representation |
---|---|
bin | 100111111100… |
… | …000000000000 |
3 | 201200220021200 |
4 | 213330000000 |
5 | 10140010001 |
6 | 1012221200 |
7 | 154662651 |
oct | 47740000 |
9 | 21626250 |
10 | 10469376 |
11 | 5a00885 |
12 | 360a800 |
13 | 22273c8 |
14 | 1567528 |
15 | dbc086 |
hex | 9fc000 |
10469376 has 90 divisors (see below), whose sum is σ = 30669912. Its totient is φ = 3440640.
The previous prime is 10469363. The next prime is 10469387. The reversal of 10469376 is 67396401.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 10469376.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 147421 + ... + 147491.
Almost surely, 210469376 is an apocalyptic number.
10469376 is a gapful number since it is divisible by the number (16) 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 10469376, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15334956).
10469376 is an abundant number, since it is smaller than the sum of its proper divisors (20200536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10469376 is an frugal number, since it uses more digits than its factorization.
10469376 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105 (or 76 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 36.
The square root of 10469376 is about 3235.6415128997. The cubic root of 10469376 is about 218.7628633524.
Subtracting 10469376 from its reverse (67396401), we obtain a square (56927025 = 75452).
The spelling of 10469376 in words is "ten million, four hundred sixty-nine thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •