Base | Representation |
---|---|
bin | 100110100011… |
… | …011001000000 |
3 | 201000110102022 |
4 | 212203121000 |
5 | 10041401212 |
6 | 1000341012 |
7 | 151621550 |
oct | 46433100 |
9 | 21013368 |
10 | 10106432 |
11 | 5783126 |
12 | 3474768 |
13 | 212b14b |
14 | 14b1160 |
15 | d49772 |
hex | 9a3640 |
10106432 has 56 divisors (see below), whose sum is σ = 24286464. Its totient is φ = 4073472.
The previous prime is 10106431. The next prime is 10106443. The reversal of 10106432 is 23460101.
It is a tau number, because it is divible by the number of its divisors (56).
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 10106432.
It is not an unprimeable number, because it can be changed into a prime (10106431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6953 + ... + 8279.
Almost surely, 210106432 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 10106432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12143232).
10106432 is an abundant number, since it is smaller than the sum of its proper divisors (14180032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10106432 is a wasteful number, since it uses less digits than its factorization.
10106432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1363 (or 1353 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 10106432 is about 3179.0614967314. The cubic root of 10106432 is about 216.2051092403.
Adding to 10106432 its reverse (23460101), we get a palindrome (33566533).
The spelling of 10106432 in words is "ten million, one hundred six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •