Base | Representation |
---|---|
bin | 110000001001111000… |
… | …0100110000101110100 |
3 | 100212220212111221001220 |
4 | 1200103300212011310 |
5 | 3143241121034030 |
6 | 115301202350340 |
7 | 10320420424626 |
oct | 1402360460564 |
9 | 325825457056 |
10 | 103410721140 |
11 | 3a946724401 |
12 | 1806005b3b0 |
13 | 99a031a42c |
14 | 501001cc16 |
15 | 2a538ada10 |
hex | 1813c26174 |
103410721140 has 24 divisors (see below), whose sum is σ = 289550019360. Its totient is φ = 27576192288.
The previous prime is 103410721111. The next prime is 103410721147. The reversal of 103410721140 is 41127014301.
It is a self number, because there is not a number n which added to its sum of digits gives 103410721140.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103410721147) 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, 861755950 + ... + 861756069.
It is an arithmetic number, because the mean of its divisors is an integer number (12064584140).
Almost surely, 2103410721140 is an apocalyptic number.
103410721140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103410721140 is an abundant number, since it is smaller than the sum of its proper divisors (186139298220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103410721140 is a wasteful number, since it uses less digits than its factorization.
103410721140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1723512031 (or 1723512029 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 24.
Adding to 103410721140 its reverse (41127014301), we get a palindrome (144537735441).
The spelling of 103410721140 in words is "one hundred three billion, four hundred ten million, seven hundred twenty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •