Base | Representation |
---|---|
bin | 110000000000101001… |
… | …1100100101000101111 |
3 | 100212010021221201102112 |
4 | 1200001103210220233 |
5 | 3142122341414434 |
6 | 115210342514235 |
7 | 10306641041531 |
oct | 1400123445057 |
9 | 325107851375 |
10 | 103101123119 |
11 | 3a7a7994875 |
12 | 17b9443597b |
13 | 995113ba37 |
14 | 4dc0c6b851 |
15 | 2a36605dce |
hex | 18014e4a2f |
103101123119 has 6 divisors (see below), whose sum is σ = 108813097080. Its totient is φ = 97674747876.
The previous prime is 103101123101. The next prime is 103101123143. The reversal of 103101123119 is 911321101301.
It is a happy number.
It is not a de Polignac number, because 103101123119 - 220 = 103100074543 is a prime.
It is a super-2 number, since 2×1031011231192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103101123094 and 103101123103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103101123319) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 142798979 + ... + 142799700.
It is an arithmetic number, because the mean of its divisors is an integer number (18135516180).
Almost surely, 2103101123119 is an apocalyptic number.
103101123119 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
103101123119 is a deficient number, since it is larger than the sum of its proper divisors (5711973961).
103101123119 is an equidigital number, since it uses as much as digits as its factorization.
103101123119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285598717 (or 285598698 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 23.
The spelling of 103101123119 in words is "one hundred three billion, one hundred one million, one hundred twenty-three thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •