Base | Representation |
---|---|
bin | 10111011111011001101111… |
… | …011001100100010000111111 |
3 | 111112210121221110110201121012 |
4 | 113133121233121210100333 |
5 | 102020140022122423403 |
6 | 1003421202002225435 |
7 | 30522055520143040 |
oct | 2737315731442077 |
9 | 445717843421535 |
10 | 103313012311103 |
11 | 2aa118910a3071 |
12 | b70690695527b |
13 | 45854b5596bca |
14 | 1b7253b09c8c7 |
15 | be261dc56ed8 |
hex | 5df66f66443f |
103313012311103 has 8 divisors (see below), whose sum is σ = 119116899151008. Its totient is φ = 87770346741504.
The previous prime is 103313012311087. The next prime is 103313012311127. The reversal of 103313012311103 is 301113210313301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103313012311103 - 24 = 103313012311087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103313012311703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65305316726 + ... + 65305318307.
It is an arithmetic number, because the mean of its divisors is an integer number (14889612393876).
Almost surely, 2103313012311103 is an apocalyptic number.
103313012311103 is a deficient number, since it is larger than the sum of its proper divisors (15803886839905).
103313012311103 is a wasteful number, since it uses less digits than its factorization.
103313012311103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130610635153.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 103313012311103 its reverse (301113210313301), we get a palindrome (404426222624404).
The spelling of 103313012311103 in words is "one hundred three trillion, three hundred thirteen billion, twelve million, three hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •