Base | Representation |
---|---|
bin | 11110110011010101110… |
… | …01010001110110110101 |
3 | 10202011210121022121111202 |
4 | 33121222321101312311 |
5 | 114320002432330221 |
6 | 2130111324142245 |
7 | 136315014041354 |
oct | 17315271216665 |
9 | 3664717277452 |
10 | 1058355355061 |
11 | 378934008964 |
12 | 151149097985 |
13 | 78a5808b134 |
14 | 3932070399b |
15 | 1c7e48ebd0b |
hex | f66ae51db5 |
1058355355061 has 8 divisors (see below), whose sum is σ = 1074351467040. Its totient is φ = 1042365118608.
The previous prime is 1058355354943. The next prime is 1058355355073. The reversal of 1058355355061 is 1605535538501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1058355355061 is a prime.
It is a super-2 number, since 2×10583553550612 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1058355354997 and 1058355355015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1058355351061) 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, 1105226 + ... + 1827083.
It is an arithmetic number, because the mean of its divisors is an integer number (134293933380).
Almost surely, 21058355355061 is an apocalyptic number.
It is an amenable number.
1058355355061 is a deficient number, since it is larger than the sum of its proper divisors (15996111979).
1058355355061 is an equidigital number, since it uses as much as digits as its factorization.
1058355355061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2937763.
The product of its (nonzero) digits is 1350000, while the sum is 47.
The spelling of 1058355355061 in words is "one trillion, fifty-eight billion, three hundred fifty-five million, three hundred fifty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •