Base | Representation |
---|---|
bin | 11011100110100110100100… |
… | …10111011111010101101001 |
3 | 21221220212022212102201101201 |
4 | 31303103102113133111221 |
5 | 30424002103320400410 |
6 | 333033110502044201 |
7 | 15533300523110500 |
oct | 1563232227372551 |
9 | 257825285381351 |
10 | 60700007200105 |
11 | 183828016892a9 |
12 | 6984099719661 |
13 | 27b3ca8669740 |
14 | 10dbc78993837 |
15 | 703e2e5cd83a |
hex | 3734d25df569 |
60700007200105 has 24 divisors (see below), whose sum is σ = 91250120718792. Its totient is φ = 38421103456512.
The previous prime is 60700007200087. The next prime is 60700007200193. The reversal of 60700007200105 is 50100270000706.
It can be written as a sum of positive squares in 4 ways, for example, as 9549632701504 + 51150374498601 = 3090248^2 + 7151949^2 .
It is not a de Polignac number, because 60700007200105 - 225 = 60699973645673 is a prime.
It is a super-2 number, since 2×607000072001052 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9529040332 + ... + 9529046701.
It is an arithmetic number, because the mean of its divisors is an integer number (3802088363283).
Almost surely, 260700007200105 is an apocalyptic number.
60700007200105 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
60700007200105 is a deficient number, since it is larger than the sum of its proper divisors (30550113518687).
60700007200105 is a wasteful number, since it uses less digits than its factorization.
60700007200105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19058087065 (or 19058087058 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 28.
The spelling of 60700007200105 in words is "sixty trillion, seven hundred billion, seven million, two hundred thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •