Base | Representation |
---|---|
bin | 110000001000001010… |
… | …1101011110111010010 |
3 | 100212202212112102102120 |
4 | 1200100111223313102 |
5 | 3143131423212000 |
6 | 115251352355110 |
7 | 10316122566054 |
oct | 1402025536722 |
9 | 325685472376 |
10 | 103353335250 |
11 | 3a917299550 |
12 | 180449a5a96 |
13 | 9991477299 |
14 | 50065618d4 |
15 | 2a4d8256a0 |
hex | 181056bdd2 |
103353335250 has 64 divisors (see below), whose sum is σ = 281421758592. Its totient is φ = 25055352000.
The previous prime is 103353335227. The next prime is 103353335257. The reversal of 103353335250 is 52533353301.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (103353335257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6255589 + ... + 6272088.
It is an arithmetic number, because the mean of its divisors is an integer number (4397214978).
Almost surely, 2103353335250 is an apocalyptic number.
103353335250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103353335250 is an abundant number, since it is smaller than the sum of its proper divisors (178068423342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103353335250 is a wasteful number, since it uses less digits than its factorization.
103353335250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12527708 (or 12527698 counting only the distinct ones).
The product of its (nonzero) digits is 60750, while the sum is 33.
Adding to 103353335250 its reverse (52533353301), we get a palindrome (155886688551).
The spelling of 103353335250 in words is "one hundred three billion, three hundred fifty-three million, three hundred thirty-five thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •