Base | Representation |
---|---|
bin | 11110101101001101000… |
… | …10101101110101011010 |
3 | 10201212022000121102100122 |
4 | 33112212202231311122 |
5 | 114241231120343020 |
6 | 2124404405033242 |
7 | 136140253300622 |
oct | 17264642556532 |
9 | 3655260542318 |
10 | 1055061106010 |
11 | 3774a354188a |
12 | 1505899b5822 |
13 | 78651740642 |
14 | 390cadc3882 |
15 | 1c6a05d3125 |
hex | f5a68add5a |
1055061106010 has 8 divisors (see below), whose sum is σ = 1899109990836. Its totient is φ = 422024442400.
The previous prime is 1055061106009. The next prime is 1055061106019. The reversal of 1055061106010 is 106011605501.
It can be written as a sum of positive squares in 2 ways, for example, as 998934284089 + 56126821921 = 999467^2 + 236911^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×10550611060103 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1055061106019) 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 3 ways as a sum of consecutive naturals, for example, 52753055291 + ... + 52753055310.
Almost surely, 21055061106010 is an apocalyptic number.
1055061106010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1055061106010 is a deficient number, since it is larger than the sum of its proper divisors (844048884826).
1055061106010 is a wasteful number, since it uses less digits than its factorization.
1055061106010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105506110608.
The product of its (nonzero) digits is 900, while the sum is 26.
The spelling of 1055061106010 in words is "one trillion, fifty-five billion, sixty-one million, one hundred six thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •