Base | Representation |
---|---|
bin | 11110110111011100000… |
… | …10010111000101001101 |
3 | 10202101110221101011000012 |
4 | 33123232002113011031 |
5 | 114334004210113203 |
6 | 2131113522043005 |
7 | 136423361305055 |
oct | 17335602270515 |
9 | 3671427334005 |
10 | 1060555551053 |
11 | 379862a61759 |
12 | 151661aa9465 |
13 | 79018b5aa5b |
14 | 3948c9d2565 |
15 | 1c8c2b56bd8 |
hex | f6ee09714d |
1060555551053 has 8 divisors (see below), whose sum is σ = 1064245632000. Its totient is φ = 1056870164448.
The previous prime is 1060555551023. The next prime is 1060555551103. The reversal of 1060555551053 is 3501555550601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1060555551053 - 228 = 1060287115597 is a prime.
It is a super-2 number, since 2×10605555510532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
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 1060555551053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1060555551023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 720653 + ... + 1624946.
It is an arithmetic number, because the mean of its divisors is an integer number (133030704000).
Almost surely, 21060555551053 is an apocalyptic number.
It is an amenable number.
1060555551053 is a deficient number, since it is larger than the sum of its proper divisors (3690080947).
1060555551053 is a wasteful number, since it uses less digits than its factorization.
1060555551053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2347171.
The product of its (nonzero) digits is 281250, while the sum is 41.
The spelling of 1060555551053 in words is "one trillion, sixty billion, five hundred fifty-five million, five hundred fifty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •