Base | Representation |
---|---|
bin | 11110111000010111100… |
… | …11110100011010010011 |
3 | 10202102202202021121022011 |
4 | 33130023303310122103 |
5 | 114341020043234012 |
6 | 2131235244123351 |
7 | 136441635106216 |
oct | 17341363643223 |
9 | 3672682247264 |
10 | 1061055055507 |
11 | 379a99a0a857 |
12 | 151781236557 |
13 | 7909849b415 |
14 | 394d909977d |
15 | 1c9019231a7 |
hex | f70bcf4693 |
1061055055507 has 16 divisors (see below), whose sum is σ = 1065367240704. Its totient is φ = 1056755700000.
The previous prime is 1061055055493. The next prime is 1061055055517. The reversal of 1061055055507 is 7055505501601.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1061055055507 is a prime.
It is a super-2 number, since 2×10610550555072 (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 1061055055507.
It is not an unprimeable number, because it can be changed into a prime (1061055055517) 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 15 ways as a sum of consecutive naturals, for example, 799588678 + ... + 799590004.
It is an arithmetic number, because the mean of its divisors is an integer number (66585452544).
Almost surely, 21061055055507 is an apocalyptic number.
1061055055507 is a deficient number, since it is larger than the sum of its proper divisors (4312185197).
1061055055507 is a wasteful number, since it uses less digits than its factorization.
1061055055507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4170.
The product of its (nonzero) digits is 131250, while the sum is 40.
The spelling of 1061055055507 in words is "one trillion, sixty-one billion, fifty-five million, fifty-five thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •