Base | Representation |
---|---|
bin | 11110110111011100101… |
… | …01101001001110111010 |
3 | 10202101111021212222021120 |
4 | 33123232111221032322 |
5 | 114334012003344023 |
6 | 2131114222250110 |
7 | 136423452260655 |
oct | 17335625511672 |
9 | 3671437788246 |
10 | 1060560606138 |
11 | 3798658a4710 |
12 | 151663726936 |
13 | 79019c0a927 |
14 | 3948d54a89c |
15 | 1c8c33048e3 |
hex | f6ee5693ba |
1060560606138 has 32 divisors (see below), whose sum is σ = 2314004594112. Its totient is φ = 321374476800.
The previous prime is 1060560606109. The next prime is 1060560606151. The reversal of 1060560606138 is 8316060650601.
It is a super-2 number, since 2×10605606061382 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1060560606138.
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, 3078420 + ... + 3405552.
It is an arithmetic number, because the mean of its divisors is an integer number (72312643566).
Almost surely, 21060560606138 is an apocalyptic number.
1060560606138 is an abundant number, since it is smaller than the sum of its proper divisors (1253443987974).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1060560606138 is a wasteful number, since it uses less digits than its factorization.
1060560606138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376270.
The product of its (nonzero) digits is 155520, while the sum is 42.
The spelling of 1060560606138 in words is "one trillion, sixty billion, five hundred sixty million, six hundred six thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •