Base | Representation |
---|---|
bin | 10111011111111110000100… |
… | …101011101110110010101011 |
3 | 111112221100122021000221022212 |
4 | 113133332010223232302223 |
5 | 102021304421132200021 |
6 | 1003451133040235335 |
7 | 30524636334652661 |
oct | 2737760453566253 |
9 | 445840567027285 |
10 | 103352024100011 |
11 | 2aa2739024a525 |
12 | b71239390bb4b |
13 | 45890919a917b |
14 | 1b7439c30ac31 |
15 | be3653ada85b |
hex | 5dff84aeecab |
103352024100011 has 8 divisors (see below), whose sum is σ = 103416635466000. Its totient is φ = 103287417184800.
The previous prime is 103352024099983. The next prime is 103352024100023. The reversal of 103352024100011 is 110001420253301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103352024100011 - 238 = 103077146193067 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103352024100011.
It is not an unprimeable number, because it can be changed into a prime (103352024100071) 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, 45966005 + ... + 48161993.
It is an arithmetic number, because the mean of its divisors is an integer number (12927079433250).
Almost surely, 2103352024100011 is an apocalyptic number.
103352024100011 is a deficient number, since it is larger than the sum of its proper divisors (64611365989).
103352024100011 is a wasteful number, since it uses less digits than its factorization.
103352024100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2225389.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 103352024100011 its reverse (110001420253301), we get a palindrome (213353444353312).
The spelling of 103352024100011 in words is "one hundred three trillion, three hundred fifty-two billion, twenty-four million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •