Base | Representation |
---|---|
bin | 100111100001… |
… | …100111110010 |
3 | 201111102001222 |
4 | 213201213302 |
5 | 10123030310 |
6 | 1010025042 |
7 | 154032650 |
oct | 47414762 |
9 | 21442058 |
10 | 10361330 |
11 | 5937691 |
12 | 3578182 |
13 | 21ba185 |
14 | 1539dd0 |
15 | d9a055 |
hex | 9e19f2 |
10361330 has 32 divisors (see below), whose sum is σ = 22571136. Its totient is φ = 3343104.
The previous prime is 10361321. The next prime is 10361357. The reversal of 10361330 is 3316301.
10361330 = 5272 + 5282 + ... + 5612.
It is a super-3 number, since 3×103613303 (a number of 22 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10361299 and 10361308.
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 15 ways as a sum of consecutive naturals, for example, 3164 + ... + 5543.
It is an arithmetic number, because the mean of its divisors is an integer number (705348).
Almost surely, 210361330 is an apocalyptic number.
10361330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10361330 is an abundant number, since it is smaller than the sum of its proper divisors (12209806).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10361330 is a wasteful number, since it uses less digits than its factorization.
10361330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8738.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 10361330 is about 3218.9019867029. The cubic root of 10361330 is about 218.0077010999.
Adding to 10361330 its reverse (3316301), we get a palindrome (13677631).
The spelling of 10361330 in words is "ten million, three hundred sixty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •