Base | Representation |
---|---|
bin | 110000000100010100… |
… | …1111111101000010000 |
3 | 100212102212222221020210 |
4 | 1200020221333220100 |
5 | 3142400424110420 |
6 | 115230510004120 |
7 | 10312666163115 |
oct | 1401051775020 |
9 | 325385887223 |
10 | 103224441360 |
11 | 3a860562677 |
12 | 180097a6640 |
13 | 9970858101 |
14 | 4dd33ac90c |
15 | 2a423649e0 |
hex | 1808a7fa10 |
103224441360 has 40 divisors (see below), whose sum is σ = 319995768960. Its totient is φ = 27526517632.
The previous prime is 103224441277. The next prime is 103224441367. The reversal of 103224441360 is 63144422301.
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (103224441367) 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, 215050680 + ... + 215051159.
It is an arithmetic number, because the mean of its divisors is an integer number (7999894224).
Almost surely, 2103224441360 is an apocalyptic number.
103224441360 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103224441360 is an abundant number, since it is smaller than the sum of its proper divisors (216771327600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103224441360 is a wasteful number, since it uses less digits than its factorization.
103224441360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430101855 (or 430101849 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 103224441360 its reverse (63144422301), we get a palindrome (166368863661).
The spelling of 103224441360 in words is "one hundred three billion, two hundred twenty-four million, four hundred forty-one thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •