Base | Representation |
---|---|
bin | 100110101001… |
… | …011110101000 |
3 | 201001201121212 |
4 | 212221132220 |
5 | 10043200433 |
6 | 1001052252 |
7 | 152054342 |
oct | 46513650 |
9 | 21051555 |
10 | 10131368 |
11 | 579a935 |
12 | 3487088 |
13 | 21395c0 |
14 | 14ba292 |
15 | d51d48 |
hex | 9a97a8 |
10131368 has 32 divisors (see below), whose sum is σ = 20805960. Its totient is φ = 4596480.
The previous prime is 10131361. The next prime is 10131403. The reversal of 10131368 is 86313101.
10131368 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 2502724 + 7628644 = 1582^2 + 2762^2 .
It is not an unprimeable number, because it can be changed into a prime (10131361) 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, 5546 + ... + 7142.
Almost surely, 210131368 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 10131368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10402980).
10131368 is an abundant number, since it is smaller than the sum of its proper divisors (10674592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131368 is a wasteful number, since it uses less digits than its factorization.
10131368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1677 (or 1673 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 10131368 is about 3182.9809927174. The cubic root of 10131368 is about 216.3827803387.
Adding to 10131368 its reverse (86313101), we get a palindrome (96444469).
The spelling of 10131368 in words is "ten million, one hundred thirty-one thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •