Base | Representation |
---|---|
bin | 1001100110101101000111… |
… | …1001000011111100000010 |
3 | 1101101120121221211222111202 |
4 | 2121223101321003330002 |
5 | 2341011002024310200 |
6 | 34243241122341202 |
7 | 2136655204330646 |
oct | 231532171037402 |
9 | 41346557758452 |
10 | 10560551010050 |
11 | 3401782806588 |
12 | 12268571ba802 |
13 | 5b7b17c38612 |
14 | 2871c2078c26 |
15 | 134a8686b1d5 |
hex | 99ad1e43f02 |
10560551010050 has 48 divisors (see below), whose sum is σ = 20040547804992. Its totient is φ = 4139172206400.
The previous prime is 10560551010029. The next prime is 10560551010067. The reversal of 10560551010050 is 5001015506501.
It is a happy number.
It is a super-3 number, since 3×105605510100503 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10560551009995 and 10560551010022.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5780504 + ... + 7384803.
It is an arithmetic number, because the mean of its divisors is an integer number (417511412604).
Almost surely, 210560551010050 is an apocalyptic number.
10560551010050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10560551010050 is a deficient number, since it is larger than the sum of its proper divisors (9479996794942).
10560551010050 is a wasteful number, since it uses less digits than its factorization.
10560551010050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13165643 (or 13165638 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 29.
Adding to 10560551010050 its reverse (5001015506501), we get a palindrome (15561566516551).
The spelling of 10560551010050 in words is "ten trillion, five hundred sixty billion, five hundred fifty-one million, ten thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •