Base | Representation |
---|---|
bin | 10111100100001100101001… |
… | …110011110100110010101101 |
3 | 111120222010120000110020100011 |
4 | 113210030221303310302231 |
5 | 102041034424130134323 |
6 | 1004232422234333221 |
7 | 30554633121114352 |
oct | 2744145163646255 |
9 | 446863500406304 |
10 | 103642557271213 |
11 | 3002961a695174 |
12 | b75a75688a211 |
13 | 45aa5b3417c1c |
14 | 1b84480038629 |
15 | beaeaa10820d |
hex | 5e4329cf4cad |
103642557271213 has 8 divisors (see below), whose sum is σ = 109097554255200. Its totient is φ = 98187572842128.
The previous prime is 103642557271207. The next prime is 103642557271241. The reversal of 103642557271213 is 312172755246301.
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 103642557271213 - 29 = 103642557270701 is a prime.
It is a super-3 number, since 3×1036425572712133 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103642557271283) 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, 17178198 + ... + 22413736.
It is an arithmetic number, because the mean of its divisors is an integer number (13637194281900).
Almost surely, 2103642557271213 is an apocalyptic number.
It is an amenable number.
103642557271213 is a deficient number, since it is larger than the sum of its proper divisors (5454996983987).
103642557271213 is a wasteful number, since it uses less digits than its factorization.
103642557271213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6277451.
The product of its (nonzero) digits is 2116800, while the sum is 49.
The spelling of 103642557271213 in words is "one hundred three trillion, six hundred forty-two billion, five hundred fifty-seven million, two hundred seventy-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •