Base | Representation |
---|---|
bin | 10001110110000100111… |
… | …00101111101001010101 |
3 | 2011121122022111221122122 |
4 | 20323002130233221111 |
5 | 40021211300434000 |
6 | 1145402014305325 |
7 | 62204241132503 |
oct | 10730234575125 |
9 | 2147568457578 |
10 | 613147671125 |
11 | 21704196a500 |
12 | 9a9b9ab8245 |
13 | 45a867c4072 |
14 | 2196848d673 |
15 | 10e3923e085 |
hex | 8ec272fa55 |
613147671125 has 36 divisors (see below), whose sum is σ = 841228842636. Its totient is φ = 445855542000.
The previous prime is 613147671119. The next prime is 613147671229. The reversal of 613147671125 is 521176741316.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 19620725476 + 593526945649 = 140074^2 + 770407^2 .
It is not a de Polignac number, because 613147671125 - 28 = 613147670869 is a prime.
It is a super-2 number, since 2×6131476711252 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 96297692 + ... + 96304058.
It is an arithmetic number, because the mean of its divisors is an integer number (23367467851).
Almost surely, 2613147671125 is an apocalyptic number.
It is an amenable number.
613147671125 is a deficient number, since it is larger than the sum of its proper divisors (228081171511).
613147671125 is an frugal number, since it uses more digits than its factorization.
613147671125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12771 (or 6383 counting only the distinct ones).
The product of its digits is 211680, while the sum is 44.
The spelling of 613147671125 in words is "six hundred thirteen billion, one hundred forty-seven million, six hundred seventy-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •