Base | Representation |
---|---|
bin | 1100010100001… |
… | …11000000000000 |
3 | 21012101212100112 |
4 | 12022013000000 |
5 | 202422012113 |
6 | 14130210452 |
7 | 2363102162 |
oct | 612070000 |
9 | 235355315 |
10 | 103313408 |
11 | 53354990 |
12 | 2a723a28 |
13 | 185339c3 |
14 | da14932 |
15 | 910b5a8 |
hex | 6287000 |
103313408 has 52 divisors (see below), whose sum is σ = 225481848. Its totient is φ = 46940160.
The previous prime is 103313389. The next prime is 103313453. The reversal of 103313408 is 804313301.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43910 + ... + 46202.
Almost surely, 2103313408 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 103313408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112740924).
103313408 is an abundant number, since it is smaller than the sum of its proper divisors (122168440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103313408 is an equidigital number, since it uses as much as digits as its factorization.
103313408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2328 (or 2306 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 103313408 is about 10164.3203412722. The cubic root of 103313408 is about 469.2297751314.
Adding to 103313408 its reverse (804313301), we get a palindrome (907626709).
It can be divided in two parts, 1033 and 13408, that added together give a palindrome (14441).
The spelling of 103313408 in words is "one hundred three million, three hundred thirteen thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •