Base | Representation |
---|---|
bin | 1001101011111100100101… |
… | …0110111001100011110111 |
3 | 1101201012001202221212122022 |
4 | 2122333021112321203313 |
5 | 2343444413122301020 |
6 | 34352452531023355 |
7 | 2146323564360653 |
oct | 232771126714367 |
9 | 41635052855568 |
10 | 10650602150135 |
11 | 3436993286a02 |
12 | 12401a913ab5b |
13 | 5c3469524bac |
14 | 28b6c5a89a63 |
15 | 1370a744a625 |
hex | 9afc95b98f7 |
10650602150135 has 8 divisors (see below), whose sum is σ = 12781362600000. Its totient is φ = 8520055040224.
The previous prime is 10650602150117. The next prime is 10650602150141. The reversal of 10650602150135 is 53105120605601.
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 10650602150135 - 28 = 10650602149879 is a prime.
It is a super-2 number, since 2×106506021501352 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10650602150095 and 10650602150104.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53225135 + ... + 53424864.
It is an arithmetic number, because the mean of its divisors is an integer number (1597670325000).
Almost surely, 210650602150135 is an apocalyptic number.
10650602150135 is a deficient number, since it is larger than the sum of its proper divisors (2130760449865).
10650602150135 is a wasteful number, since it uses less digits than its factorization.
10650602150135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106669977.
The product of its (nonzero) digits is 27000, while the sum is 35.
Adding to 10650602150135 its reverse (53105120605601), we get a palindrome (63755722755736).
The spelling of 10650602150135 in words is "ten trillion, six hundred fifty billion, six hundred two million, one hundred fifty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •