Base | Representation |
---|---|
bin | 1001100011100010101110… |
… | …0010010001100111001101 |
3 | 1101012101101120020121021010 |
4 | 2120320223202101213031 |
5 | 2334113214411130331 |
6 | 34202254021155433 |
7 | 2133022636010664 |
oct | 230705342214715 |
9 | 41171346217233 |
10 | 10506220411341 |
11 | 3390732586636 |
12 | 1218213b5bb79 |
13 | 5b2969c24a65 |
14 | 28470a537ddb |
15 | 133456beae46 |
hex | 98e2b8919cd |
10506220411341 has 32 divisors (see below), whose sum is σ = 15104152166400. Its totient is φ = 6472097058560.
The previous prime is 10506220411201. The next prime is 10506220411343. The reversal of 10506220411341 is 14311402260501.
It is not a de Polignac number, because 10506220411341 - 218 = 10506220149197 is a prime.
It is a super-2 number, since 2×105062204113412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10506220411299 and 10506220411308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10506220411343) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5204601 + ... + 6935438.
It is an arithmetic number, because the mean of its divisors is an integer number (472004755200).
Almost surely, 210506220411341 is an apocalyptic number.
It is an amenable number.
10506220411341 is a deficient number, since it is larger than the sum of its proper divisors (4597931755059).
10506220411341 is a wasteful number, since it uses less digits than its factorization.
10506220411341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12140369.
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 10506220411341 its reverse (14311402260501), we get a palindrome (24817622671842).
The spelling of 10506220411341 in words is "ten trillion, five hundred six billion, two hundred twenty million, four hundred eleven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •