Base | Representation |
---|---|
bin | 10111011111101010100110… |
… | …000111101100001101011000 |
3 | 111112212100122201220211100020 |
4 | 113133222212013230031120 |
5 | 102020434103210203422 |
6 | 1003433353503510440 |
7 | 30523266145046265 |
oct | 2737524607541530 |
9 | 445770581824306 |
10 | 103331110241112 |
11 | 2aa19528992816 |
12 | b70a3178b8420 |
13 | 458710ab94a30 |
14 | 1b733768dc26c |
15 | be2d2ca0695c |
hex | 5dfaa61ec358 |
103331110241112 has 64 divisors (see below), whose sum is σ = 278202812751360. Its totient is φ = 31793768361600.
The previous prime is 103331110241081. The next prime is 103331110241231. The reversal of 103331110241112 is 211142011133301.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21931537 + ... + 26223167.
It is an arithmetic number, because the mean of its divisors is an integer number (4346918949240).
Almost surely, 2103331110241112 is an apocalyptic number.
103331110241112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103331110241112 is an abundant number, since it is smaller than the sum of its proper divisors (174871702510248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103331110241112 is a wasteful number, since it uses less digits than its factorization.
103331110241112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4368824 (or 4368820 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 103331110241112 its reverse (211142011133301), we get a palindrome (314473121374413).
The spelling of 103331110241112 in words is "one hundred three trillion, three hundred thirty-one billion, one hundred ten million, two hundred forty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •