Base | Representation |
---|---|
bin | 10001110110000101100… |
… | …11011000101110001100 |
3 | 2011121122201200111111211 |
4 | 20323002303120232030 |
5 | 40021214310402130 |
6 | 1145402345424204 |
7 | 62204342443066 |
oct | 10730263305614 |
9 | 2147581614454 |
10 | 613153606540 |
11 | 217045253902 |
12 | 9a9bba9b064 |
13 | 45a87ac1847 |
14 | 21969196736 |
15 | 10e39a12a2a |
hex | 8ec2cd8b8c |
613153606540 has 24 divisors (see below), whose sum is σ = 1288046122272. Its totient is φ = 245180766720.
The previous prime is 613153606523. The next prime is 613153606567. The reversal of 613153606540 is 45606351316.
It is a hoax number, since the sum of its digits (40) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 613153606493 and 613153606502.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4979904 + ... + 5101543.
It is an arithmetic number, because the mean of its divisors is an integer number (53668588428).
Almost surely, 2613153606540 is an apocalyptic number.
It is an amenable number.
613153606540 is an abundant number, since it is smaller than the sum of its proper divisors (674892515732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
613153606540 is a wasteful number, since it uses less digits than its factorization.
613153606540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10084497 (or 10084495 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 40.
Adding to 613153606540 its reverse (45606351316), we get a palindrome (658759957856).
The spelling of 613153606540 in words is "six hundred thirteen billion, one hundred fifty-three million, six hundred six thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •