Base | Representation |
---|---|
bin | 10111011111010000101000… |
… | …011001010010001011101111 |
3 | 111112202200200210102202000011 |
4 | 113133100220121102023233 |
5 | 102020010004131320421 |
6 | 1003412503233314051 |
7 | 30521261240324161 |
oct | 2737205031221357 |
9 | 445680623382004 |
10 | 103303231120111 |
11 | 2aa08721948550 |
12 | b704a37105927 |
13 | 45845b701b029 |
14 | 1b71c90016931 |
15 | be224a1bb4e1 |
hex | 5df4286522ef |
103303231120111 has 16 divisors (see below), whose sum is σ = 112977396717696. Its totient is φ = 93676286340000.
The previous prime is 103303231120051. The next prime is 103303231120127. The reversal of 103303231120111 is 111021132303301.
It is a cyclic number.
It is not a de Polignac number, because 103303231120111 - 223 = 103303222731503 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 (103303231120711) 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, 32815356 + ... + 35825326.
It is an arithmetic number, because the mean of its divisors is an integer number (7061087294856).
Almost surely, 2103303231120111 is an apocalyptic number.
103303231120111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
103303231120111 is a deficient number, since it is larger than the sum of its proper divisors (9674165597585).
103303231120111 is a wasteful number, since it uses less digits than its factorization.
103303231120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3017814.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 103303231120111 its reverse (111021132303301), we get a palindrome (214324363423412).
The spelling of 103303231120111 in words is "one hundred three trillion, three hundred three billion, two hundred thirty-one million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •