Base | Representation |
---|---|
bin | 1000101101100111110110000… |
… | …1111110011111010000100101 |
3 | 2222101211222120201002020201222 |
4 | 2023121331201332133100211 |
5 | 1120330213420140222323 |
6 | 10011552000424230125 |
7 | 243066626544306125 |
oct | 21331754176372045 |
9 | 2871758521066658 |
10 | 613112520242213 |
11 | 1683a1617959052 |
12 | 5892139260b345 |
13 | 20415354b5ab04 |
14 | ab58b39076c85 |
15 | 4ad36e4d259c8 |
hex | 22d9f61f9f425 |
613112520242213 has 8 divisors (see below), whose sum is σ = 649179228575232. Its totient is φ = 577045952572096.
The previous prime is 613112520242191. The next prime is 613112520242249. The reversal of 613112520242213 is 312242025211316.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 613112520242213 - 28 = 613112520241957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (613112520242263) 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, 26125445 + ... + 43689402.
It is an arithmetic number, because the mean of its divisors is an integer number (81147403571904).
Almost surely, 2613112520242213 is an apocalyptic number.
It is an amenable number.
613112520242213 is a deficient number, since it is larger than the sum of its proper divisors (36066708333019).
613112520242213 is a wasteful number, since it uses less digits than its factorization.
613112520242213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70331451.
The product of its (nonzero) digits is 34560, while the sum is 35.
Adding to 613112520242213 its reverse (312242025211316), we get a palindrome (925354545453529).
The spelling of 613112520242213 in words is "six hundred thirteen trillion, one hundred twelve billion, five hundred twenty million, two hundred forty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •