Base | Representation |
---|---|
bin | 1001100011100000010000… |
… | …1100111100111010011110 |
3 | 1101012022200120112010221210 |
4 | 2120320010030330322132 |
5 | 2334110341442310420 |
6 | 34202104325205250 |
7 | 2133000403645461 |
oct | 230700414747236 |
9 | 41168616463853 |
10 | 10505560510110 |
11 | 3390424035016 |
12 | 121806ab60826 |
13 | 5b28932b5163 |
14 | 284686a3b2d8 |
15 | 133418ce99e0 |
hex | 98e0433ce9e |
10505560510110 has 32 divisors (see below), whose sum is σ = 25236329209632. Its totient is φ = 2798929026560.
The previous prime is 10505560510073. The next prime is 10505560510127. The reversal of 10505560510110 is 1101506550501.
It is a super-2 number, since 2×105055605101102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 159577551 + ... + 159643370.
It is an arithmetic number, because the mean of its divisors is an integer number (788635287801).
Almost surely, 210505560510110 is an apocalyptic number.
10505560510110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10505560510110 is an abundant number, since it is smaller than the sum of its proper divisors (14730768699522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10505560510110 is a wasteful number, since it uses less digits than its factorization.
10505560510110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319222028.
The product of its (nonzero) digits is 3750, while the sum is 30.
Subtracting from 10505560510110 its reverse (1101506550501), we obtain a square (9404053959609 = 30666032).
The spelling of 10505560510110 in words is "ten trillion, five hundred five billion, five hundred sixty million, five hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •