Base | Representation |
---|---|
bin | 1001101001100111001101… |
… | …1000011100111110100001 |
3 | 1101120100120100010011102222 |
4 | 2122121303120130332201 |
5 | 2342320303240323410 |
6 | 34322222042120425 |
7 | 2143404130331666 |
oct | 232316330347641 |
9 | 41510510104388 |
10 | 10610505011105 |
11 | 342098751097a |
12 | 12344787b0115 |
13 | 5bc7492c111c |
14 | 2897a0633a6d |
15 | 13600c176955 |
hex | 9a67361cfa1 |
10610505011105 has 16 divisors (see below), whose sum is σ = 12744879206400. Its totient is φ = 8480224022592.
The previous prime is 10610505011101. The next prime is 10610505011111. The reversal of 10610505011105 is 50111050501601.
It is a cyclic number.
It is not a de Polignac number, because 10610505011105 - 22 = 10610505011101 is a prime.
It is a super-2 number, since 2×106105050111052 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10610505011101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40684832 + ... + 40944798.
It is an arithmetic number, because the mean of its divisors is an integer number (796554950400).
Almost surely, 210610505011105 is an apocalyptic number.
It is an amenable number.
10610505011105 is a deficient number, since it is larger than the sum of its proper divisors (2134374195295).
10610505011105 is a wasteful number, since it uses less digits than its factorization.
10610505011105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267808.
The product of its (nonzero) digits is 750, while the sum is 26.
Adding to 10610505011105 its reverse (50111050501601), we get a palindrome (60721555512706).
The spelling of 10610505011105 in words is "ten trillion, six hundred ten billion, five hundred five million, eleven thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •