Base | Representation |
---|---|
bin | 11110101101111100011… |
… | …01011010100101111001 |
3 | 10201220022200202122002121 |
4 | 33112332031122211321 |
5 | 114243034243102403 |
6 | 2124512031401241 |
7 | 136153144315321 |
oct | 17267615324571 |
9 | 3656280678077 |
10 | 1055458175353 |
11 | 37768769596a |
12 | 15067a983221 |
13 | 786b5a9700a |
14 | 39127a24281 |
15 | 1c6c53b83bd |
hex | f5be35a979 |
1055458175353 has 8 divisors (see below), whose sum is σ = 1068867707648. Its totient is φ = 1042109457984.
The previous prime is 1055458175341. The next prime is 1055458175437. The reversal of 1055458175353 is 3535718545501.
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-1055458175353 is a prime.
It is a super-2 number, since 2×10554581753532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1055458175353.
It is not an unprimeable number, because it can be changed into a prime (1055458175333) 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, 15168801 + ... + 15238222.
It is an arithmetic number, because the mean of its divisors is an integer number (133608463456).
Almost surely, 21055458175353 is an apocalyptic number.
It is an amenable number.
1055458175353 is a deficient number, since it is larger than the sum of its proper divisors (13409532295).
1055458175353 is a wasteful number, since it uses less digits than its factorization.
1055458175353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30407463.
The product of its (nonzero) digits is 6300000, while the sum is 52.
The spelling of 1055458175353 in words is "one trillion, fifty-five billion, four hundred fifty-eight million, one hundred seventy-five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •