Base | Representation |
---|---|
bin | 110000000000101011… |
… | …1110000011101011011 |
3 | 100212010101000110020022 |
4 | 1200001113300131123 |
5 | 3142123132020443 |
6 | 115210422221055 |
7 | 10306653261020 |
oct | 1400127603533 |
9 | 325111013208 |
10 | 103102220123 |
11 | 3a7a8573a91 |
12 | 17b9488478b |
13 | 9951434156 |
14 | 4dc1075547 |
15 | 2a36770e68 |
hex | 18015f075b |
103102220123 has 8 divisors (see below), whose sum is σ = 118581626592. Its totient is φ = 87810443136.
The previous prime is 103102220099. The next prime is 103102220131. The reversal of 103102220123 is 321022201301.
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 103102220123 - 26 = 103102220059 is a prime.
It is a super-2 number, since 2×1031022201232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103102220153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46906190 + ... + 46908387.
It is an arithmetic number, because the mean of its divisors is an integer number (14822703324).
Almost surely, 2103102220123 is an apocalyptic number.
103102220123 is a deficient number, since it is larger than the sum of its proper divisors (15479406469).
103102220123 is an equidigital number, since it uses as much as digits as its factorization.
103102220123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93814741.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 103102220123 its reverse (321022201301), we get a palindrome (424124421424).
The spelling of 103102220123 in words is "one hundred three billion, one hundred two million, two hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •