Base | Representation |
---|---|
bin | 10111011111110100111101… |
… | …101001001000010101110100 |
3 | 111112220102101112212002002201 |
4 | 113133310331221020111310 |
5 | 102021124403012120200 |
6 | 1003442434250314244 |
7 | 30524142050023252 |
oct | 2737647551102564 |
9 | 445812345762081 |
10 | 103342242301300 |
11 | 2aa2322071a362 |
12 | b710503a28984 |
13 | 45881932797b2 |
14 | 1b73b111475d2 |
15 | be327ee7ec6a |
hex | 5dfd3da48574 |
103342242301300 has 18 divisors (see below), whose sum is σ = 224252665794038. Its totient is φ = 41336896920480.
The previous prime is 103342242301289. The next prime is 103342242301387. The reversal of 103342242301300 is 3103242243301.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 280234714384 + 103062007586916 = 529372^2 + 10151946^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 516711211407 + ... + 516711211606.
Almost surely, 2103342242301300 is an apocalyptic number.
103342242301300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103342242301300 is an abundant number, since it is smaller than the sum of its proper divisors (120910423492738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103342242301300 is a wasteful number, since it uses less digits than its factorization.
103342242301300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1033422423027 (or 1033422423020 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 103342242301300 its reverse (3103242243301), we get a palindrome (106445484544601).
The spelling of 103342242301300 in words is "one hundred three trillion, three hundred forty-two billion, two hundred forty-two million, three hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •