Base | Representation |
---|---|
bin | 10001110110000001110… |
… | …00010101110110000001 |
3 | 2011121120110222202021201 |
4 | 20323000320111312001 |
5 | 40021133031213131 |
6 | 1145355234221201 |
7 | 62203501331533 |
oct | 10730070256601 |
9 | 2147513882251 |
10 | 613121351041 |
11 | 217029022871 |
12 | 9a9b1124801 |
13 | 45a8120a054 |
14 | 21964b9b853 |
15 | 10e36c90761 |
hex | 8ec0e15d81 |
613121351041 has 8 divisors (see below), whose sum is σ = 621916010784. Its totient is φ = 604337387040.
The previous prime is 613121351033. The next prime is 613121351057. The reversal of 613121351041 is 140153121316.
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 613121351041 - 23 = 613121351033 is a prime.
It is a super-2 number, since 2×6131213510412 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (613161351041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2558431 + ... + 2787796.
It is an arithmetic number, because the mean of its divisors is an integer number (77739501348).
Almost surely, 2613121351041 is an apocalyptic number.
It is an amenable number.
613121351041 is a deficient number, since it is larger than the sum of its proper divisors (8794659743).
613121351041 is a wasteful number, since it uses less digits than its factorization.
613121351041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5347871.
The product of its (nonzero) digits is 2160, while the sum is 28.
Adding to 613121351041 its reverse (140153121316), we get a palindrome (753274472357).
The spelling of 613121351041 in words is "six hundred thirteen billion, one hundred twenty-one million, three hundred fifty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •