Base | Representation |
---|---|
bin | 10111011011000001100110… |
… | …110110100010101001110101 |
3 | 111111201212112210221010211101 |
4 | 113123001212312202221311 |
5 | 102000223012111413023 |
6 | 1003031054445010101 |
7 | 30461246604661105 |
oct | 2733014666425165 |
9 | 444655483833741 |
10 | 103012221201013 |
11 | 2a906268388083 |
12 | b678560553931 |
13 | 456301a8a8927 |
14 | 1b61b64c67205 |
15 | bd98b6dca1ad |
hex | 5db066da2a75 |
103012221201013 has 16 divisors (see below), whose sum is σ = 113856059721600. Its totient is φ = 92703085618176.
The previous prime is 103012221200951. The next prime is 103012221201067. The reversal of 103012221201013 is 310102122210301.
It is a cyclic number.
It is not a de Polignac number, because 103012221201013 - 29 = 103012221200501 is a prime.
It is a super-2 number, since 2×1030122212010132 (a number of 29 digits) contains 22 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 (103012221201073) 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, 47603988 + ... + 49720861.
It is an arithmetic number, because the mean of its divisors is an integer number (7116003732600).
Almost surely, 2103012221201013 is an apocalyptic number.
It is an amenable number.
103012221201013 is a deficient number, since it is larger than the sum of its proper divisors (10843838520587).
103012221201013 is a wasteful number, since it uses less digits than its factorization.
103012221201013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97327596.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 103012221201013 its reverse (310102122210301), we get a palindrome (413114343411314).
The spelling of 103012221201013 in words is "one hundred three trillion, twelve billion, two hundred twenty-one million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •