Base | Representation |
---|---|
bin | 10111011011000000011111… |
… | …010000011010011000011001 |
3 | 111111201202110002200222210201 |
4 | 113123000133100122120121 |
5 | 102000213032111221241 |
6 | 1003030335335342201 |
7 | 30461205051066244 |
oct | 2733003720323031 |
9 | 444652402628721 |
10 | 103011020023321 |
11 | 2a905801347543 |
12 | b678286221961 |
13 | 4562b88a913b7 |
14 | 1b61a8d50c25b |
15 | bd984670a931 |
hex | 5db01f41a619 |
103011020023321 has 16 divisors (see below), whose sum is σ = 104329481860800. Its totient is φ = 101694428371008.
The previous prime is 103011020023291. The next prime is 103011020023357. The reversal of 103011020023321 is 123320020110301.
It is a cyclic number.
It is not a de Polignac number, because 103011020023321 - 219 = 103011019499033 is a prime.
It is a super-3 number, since 3×1030110200233213 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103011020029321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 619759495 + ... + 619925683.
It is an arithmetic number, because the mean of its divisors is an integer number (6520592616300).
Almost surely, 2103011020023321 is an apocalyptic number.
It is an amenable number.
103011020023321 is a deficient number, since it is larger than the sum of its proper divisors (1318461837479).
103011020023321 is a wasteful number, since it uses less digits than its factorization.
103011020023321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171768.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 103011020023321 its reverse (123320020110301), we get a palindrome (226331040133622).
The spelling of 103011020023321 in words is "one hundred three trillion, eleven billion, twenty million, twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.273 sec. • engine limits •