Base | Representation |
---|---|
bin | 100111010101… |
… | …111101100000 |
3 | 201101222120000 |
4 | 213111331200 |
5 | 10120013233 |
6 | 1005020000 |
7 | 153443466 |
oct | 47257540 |
9 | 21358500 |
10 | 10313568 |
11 | 5904811 |
12 | 3554600 |
13 | 21a1505 |
14 | 1526836 |
15 | d8ad13 |
hex | 9d5f60 |
10313568 has 120 divisors (see below), whose sum is σ = 31833648. Its totient is φ = 3269376.
The previous prime is 10313551. The next prime is 10313579. The reversal of 10313568 is 86531301.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 59530 + ... + 59702.
Almost surely, 210313568 is an apocalyptic number.
10313568 is a gapful number since it is divisible by the number (18) 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 10313568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15916824).
10313568 is an abundant number, since it is smaller than the sum of its proper divisors (21520080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10313568 is a wasteful number, since it uses less digits than its factorization.
10313568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218 (or 201 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 10313568 is about 3211.4744277356. The cubic root of 10313568 is about 217.6722060690.
Adding to 10313568 its reverse (86531301), we get a palindrome (96844869).
The spelling of 10313568 in words is "ten million, three hundred thirteen thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •