Base | Representation |
---|---|
bin | 100110011000… |
… | …010111010100 |
3 | 200221011110120 |
4 | 212120113110 |
5 | 10033430033 |
6 | 555351540 |
7 | 151343100 |
oct | 46302724 |
9 | 20834416 |
10 | 10061268 |
11 | 57521a8 |
12 | 34525b0 |
13 | 2113719 |
14 | 149c900 |
15 | d3b1b3 |
hex | 9985d4 |
10061268 has 72 divisors (see below), whose sum is σ = 27808704. Its totient is φ = 2822400.
The previous prime is 10061257. The next prime is 10061291. The reversal of 10061268 is 86216001.
It is a super-2 number, since 2×100612682 = 202458227535648, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 41628 + ... + 41868.
It is an arithmetic number, because the mean of its divisors is an integer number (386232).
Almost surely, 210061268 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 10061268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13904352).
10061268 is an abundant number, since it is smaller than the sum of its proper divisors (17747436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10061268 is a wasteful number, since it uses less digits than its factorization.
10061268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333 (or 324 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 24.
The square root of 10061268 is about 3171.9501887640. The cubic root of 10061268 is about 215.8825664816.
Adding to 10061268 its reverse (86216001), we get a palindrome (96277269).
The spelling of 10061268 in words is "ten million, sixty-one thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •