Base | Representation |
---|---|
bin | 10111010011101010010110… |
… | …111100110100010011111010 |
3 | 111102221111110212012000212221 |
4 | 113103222112330310103322 |
5 | 101413430220313333032 |
6 | 1002002412554154254 |
7 | 30406554511560421 |
oct | 2723522674642372 |
9 | 442844425160787 |
10 | 102506222011642 |
11 | 2a73070aaa2939 |
12 | b5b648642298a |
13 | 45273ab8b7077 |
14 | 1b45482da62b8 |
15 | bcb64e76e597 |
hex | 5d3a96f344fa |
102506222011642 has 8 divisors (see below), whose sum is σ = 153778972756500. Its totient is φ = 51246564426144.
The previous prime is 102506222011631. The next prime is 102506222011643. The reversal of 102506222011642 is 246110222605201.
It can be written as a sum of positive squares in 2 ways, for example, as 95912465967081 + 6593756044561 = 9793491^2 + 2567831^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1025062220116422 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102506222011598 and 102506222011607.
It is not an unprimeable number, because it can be changed into a prime (102506222011643) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3273270267 + ... + 3273301582.
Almost surely, 2102506222011642 is an apocalyptic number.
102506222011642 is a deficient number, since it is larger than the sum of its proper divisors (51272750744858).
102506222011642 is an equidigital number, since it uses as much as digits as its factorization.
102506222011642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6546579680.
The product of its (nonzero) digits is 23040, while the sum is 34.
Adding to 102506222011642 its reverse (246110222605201), we get a palindrome (348616444616843).
The spelling of 102506222011642 in words is "one hundred two trillion, five hundred six billion, two hundred twenty-two million, eleven thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •