Base | Representation |
---|---|
bin | 10111011011000000011111… |
… | …010001001000010001110001 |
3 | 111111201202110010001112200101 |
4 | 113123000133101020101301 |
5 | 102000213032133230223 |
6 | 1003030335343352401 |
7 | 30461205052511314 |
oct | 2733003721102161 |
9 | 444652403045611 |
10 | 103011020211313 |
11 | 2a905801465805 |
12 | b6782862b2701 |
13 | 4562b88b28b36 |
14 | 1b61a8d55a97b |
15 | bd98467464ad |
hex | 5db01f448471 |
103011020211313 has 64 divisors (see below), whose sum is σ = 109895856537600. Its totient is φ = 96451980226560.
The previous prime is 103011020211311. The next prime is 103011020211331. The reversal of 103011020211313 is 313112020110301.
It is a cyclic number.
It is not a de Polignac number, because 103011020211313 - 21 = 103011020211311 is a prime.
It is a super-3 number, since 3×1030110202113133 (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 (103011020211311) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6000516856 + ... + 6000534022.
It is an arithmetic number, because the mean of its divisors is an integer number (1717122758400).
Almost surely, 2103011020211313 is an apocalyptic number.
It is an amenable number.
103011020211313 is a deficient number, since it is larger than the sum of its proper divisors (6884836326287).
103011020211313 is a wasteful number, since it uses less digits than its factorization.
103011020211313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17710.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 103011020211313 its reverse (313112020110301), we get a palindrome (416123040321614).
The spelling of 103011020211313 in words is "one hundred three trillion, eleven billion, twenty million, two hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •