Base | Representation |
---|---|
bin | 10111011010111111110100… |
… | …011010110010001101110110 |
3 | 111111201200121000100012002001 |
4 | 113122333310122302031312 |
5 | 102000210044114301402 |
6 | 1003030140143205514 |
7 | 30461151203165356 |
oct | 2732776432621566 |
9 | 444650530305061 |
10 | 103010301322102 |
11 | 2a905472694699 |
12 | b6781055a689a |
13 | 4562aa2c04ac5 |
14 | 1b61a21ca6b66 |
15 | bd9803592187 |
hex | 5daff46b2376 |
103010301322102 has 4 divisors (see below), whose sum is σ = 154515451983156. Its totient is φ = 51505150661050.
The previous prime is 103010301322091. The next prime is 103010301322141. The reversal of 103010301322102 is 201223103010301.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1030103013221022 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103010301322102.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 25752575330524 + ... + 25752575330527.
It is an arithmetic number, because the mean of its divisors is an integer number (38628862995789).
Almost surely, 2103010301322102 is an apocalyptic number.
103010301322102 is a deficient number, since it is larger than the sum of its proper divisors (51505150661054).
103010301322102 is an equidigital number, since it uses as much as digits as its factorization.
103010301322102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51505150661053.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 103010301322102 its reverse (201223103010301), we get a palindrome (304233404332403).
The spelling of 103010301322102 in words is "one hundred three trillion, ten billion, three hundred one million, three hundred twenty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •