Base | Representation |
---|---|
bin | 10001110110011000011… |
… | …01111001111000100001 |
3 | 2011122001201220000101211 |
4 | 20323030031321320201 |
5 | 40022030224144212 |
6 | 1145430151030121 |
7 | 62211301120420 |
oct | 10731415717041 |
9 | 2148051800354 |
10 | 613311553057 |
11 | 217116423415 |
12 | 9aa4496b341 |
13 | 45ab1743718 |
14 | 2198214d2b7 |
15 | 10e488119a7 |
hex | 8ecc379e21 |
613311553057 has 8 divisors (see below), whose sum is σ = 723538053632. Its totient is φ = 508737693600.
The previous prime is 613311552983. The next prime is 613311553069. The reversal of 613311553057 is 750355113316.
It is a happy number.
613311553057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 613311553057 - 211 = 613311551009 is a prime.
It is a super-2 number, since 2×6133115530572 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (613311553157) 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, 1413160044 + ... + 1413160477.
It is an arithmetic number, because the mean of its divisors is an integer number (90442256704).
Almost surely, 2613311553057 is an apocalyptic number.
It is an amenable number.
613311553057 is a deficient number, since it is larger than the sum of its proper divisors (110226500575).
613311553057 is a wasteful number, since it uses less digits than its factorization.
613311553057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2826320559.
The product of its (nonzero) digits is 141750, while the sum is 40.
The spelling of 613311553057 in words is "six hundred thirteen billion, three hundred eleven million, five hundred fifty-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •