Base | Representation |
---|---|
bin | 10111011100011101111010… |
… | …001101011111000000011101 |
3 | 111112002100100220001111000211 |
4 | 113130131322031133000131 |
5 | 102003334001014332201 |
6 | 1003144405143252421 |
7 | 30501355612555261 |
oct | 2734357215370035 |
9 | 445070326044024 |
10 | 103111330230301 |
11 | 2a9442a6898748 |
12 | b6937bba4a111 |
13 | 456c483933763 |
14 | 1b6688783c0a1 |
15 | bdc267cbd651 |
hex | 5dc77a35f01d |
103111330230301 has 8 divisors (see below), whose sum is σ = 104390849315808. Its totient is φ = 101839271898000.
The previous prime is 103111330230269. The next prime is 103111330230367. The reversal of 103111330230301 is 103032033111301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103111330230301 - 25 = 103111330230269 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 (103111330230401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1865160490 + ... + 1865215771.
It is an arithmetic number, because the mean of its divisors is an integer number (13048856164476).
Almost surely, 2103111330230301 is an apocalyptic number.
It is an amenable number.
103111330230301 is a deficient number, since it is larger than the sum of its proper divisors (1279519085507).
103111330230301 is a wasteful number, since it uses less digits than its factorization.
103111330230301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3730376603.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 103111330230301 its reverse (103032033111301), we get a palindrome (206143363341602).
The spelling of 103111330230301 in words is "one hundred three trillion, one hundred eleven billion, three hundred thirty million, two hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •