Base | Representation |
---|---|
bin | 10111011100101000000010… |
… | …110001011110101110011101 |
3 | 111112010101110012201012201111 |
4 | 113130220002301132232131 |
5 | 102004023242043133201 |
6 | 1003153405002342021 |
7 | 30502222346263252 |
oct | 2734500261365635 |
9 | 445111405635644 |
10 | 103122211302301 |
11 | 2a94897a987134 |
12 | b695937aba911 |
13 | 45704c901b0b9 |
14 | 1b671da9d1429 |
15 | bdc6a31b9b51 |
hex | 5dca02c5eb9d |
103122211302301 has 16 divisors (see below), whose sum is σ = 107379396360000. Its totient is φ = 98912867823616.
The previous prime is 103122211302289. The next prime is 103122211302307. The reversal of 103122211302301 is 103203112221301.
It is a cyclic number.
It is not a de Polignac number, because 103122211302301 - 215 = 103122211269533 is a prime.
It is a super-2 number, since 2×1031222113023012 (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 (103122211302307) 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, 4457956 + ... + 15037213.
It is an arithmetic number, because the mean of its divisors is an integer number (6711212272500).
Almost surely, 2103122211302301 is an apocalyptic number.
It is an amenable number.
103122211302301 is a deficient number, since it is larger than the sum of its proper divisors (4257185057699).
103122211302301 is a wasteful number, since it uses less digits than its factorization.
103122211302301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19496396.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 103122211302301 its reverse (103203112221301), we get a palindrome (206325323523602).
The spelling of 103122211302301 in words is "one hundred three trillion, one hundred twenty-two billion, two hundred eleven million, three hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •