Base | Representation |
---|---|
bin | 11110101101001101000… |
… | …00100110010011111001 |
3 | 10201212021222120012220012 |
4 | 33112212200212103321 |
5 | 114241231000112110 |
6 | 2124404345111305 |
7 | 136140245466344 |
oct | 17264640462371 |
9 | 3655258505805 |
10 | 1055060550905 |
11 | 3774a31a2819 |
12 | 150589788535 |
13 | 786515a7a8a |
14 | 390cacbb45b |
15 | 1c6a0523905 |
hex | f5a68264f9 |
1055060550905 has 8 divisors (see below), whose sum is σ = 1286827950984. Its totient is φ = 830211580800.
The previous prime is 1055060550871. The next prime is 1055060550919. The reversal of 1055060550905 is 5090550605501.
It can be written as a sum of positive squares in 4 ways, for example, as 22780166761 + 1032280384144 = 150931^2 + 1016012^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1055060550905 - 218 = 1055060288761 is a prime.
It is a super-3 number, since 3×10550605509053 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1729607156 + ... + 1729607765.
It is an arithmetic number, because the mean of its divisors is an integer number (160853493873).
Almost surely, 21055060550905 is an apocalyptic number.
It is an amenable number.
1055060550905 is a deficient number, since it is larger than the sum of its proper divisors (231767400079).
1055060550905 is an equidigital number, since it uses as much as digits as its factorization.
1055060550905 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3459214987.
The product of its (nonzero) digits is 168750, while the sum is 41.
The spelling of 1055060550905 in words is "one trillion, fifty-five billion, sixty million, five hundred fifty thousand, nine hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •