Base | Representation |
---|---|
bin | 10111100011110100000110… |
… | …110111110010000101000101 |
3 | 111120212121112020001021220220 |
4 | 113203310012313302011011 |
5 | 102040121440013133331 |
6 | 1004212343054414553 |
7 | 30553011030065100 |
oct | 2743640667620505 |
9 | 446777466037826 |
10 | 103616201302341 |
11 | 30019425403712 |
12 | b755620201459 |
13 | 45a7c72cab580 |
14 | 1b8309d961737 |
15 | bea46638c296 |
hex | 5e3d06df2145 |
103616201302341 has 48 divisors (see below), whose sum is σ = 173074705812288. Its totient is φ = 54654228921600.
The previous prime is 103616201302309. The next prime is 103616201302363. The reversal of 103616201302341 is 143203102616301.
It is not a de Polignac number, because 103616201302341 - 25 = 103616201302309 is a prime.
It is a super-3 number, since 3×1036162013023413 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103616201322341) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 413742001 + ... + 413992361.
It is an arithmetic number, because the mean of its divisors is an integer number (3605723037756).
Almost surely, 2103616201302341 is an apocalyptic number.
It is an amenable number.
103616201302341 is a deficient number, since it is larger than the sum of its proper divisors (69458504509947).
103616201302341 is a wasteful number, since it uses less digits than its factorization.
103616201302341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 466962 (or 466955 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 33.
Adding to 103616201302341 its reverse (143203102616301), we get a palindrome (246819303918642).
The spelling of 103616201302341 in words is "one hundred three trillion, six hundred sixteen billion, two hundred one million, three hundred two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •