Base | Representation |
---|---|
bin | 100111001011… |
… | …000101001110 |
3 | 201022201102120 |
4 | 213023011032 |
5 | 10112102011 |
6 | 1004033410 |
7 | 153166536 |
oct | 47130516 |
9 | 21281376 |
10 | 10269006 |
11 | 5884290 |
12 | 3532866 |
13 | 2187147 |
14 | 15144c6 |
15 | d7ca06 |
hex | 9cb14e |
10269006 has 48 divisors (see below), whose sum is σ = 23701248. Its totient is φ = 2941200.
The previous prime is 10269001. The next prime is 10269011. The reversal of 10269006 is 60096201.
10269006 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10269001) and next prime (10269011).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10269001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23611 + ... + 24041.
It is an arithmetic number, because the mean of its divisors is an integer number (493776).
Almost surely, 210269006 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10269006, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11850624).
10269006 is an abundant number, since it is smaller than the sum of its proper divisors (13432242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10269006 is a wasteful number, since it uses less digits than its factorization.
10269006 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 485 (or 466 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
The square root of 10269006 is about 3204.5289825495. The cubic root of 10269006 is about 217.3582535273.
The spelling of 10269006 in words is "ten million, two hundred sixty-nine thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •