Search a number
-
+
61613250826965 = 3513638913011641
BaseRepresentation
bin11100000001001011100111…
…11011011101001011010101
322002011011120101102202022120
432000211303323131023111
531033432414202430330
6335012423042250153
715656260535625165
oct1600456373351325
9262134511382276
1061613250826965
11186a503a923a62
126ab1089056959
13284c148b18136
141130150c025a5
1571ca7e632c10
hex380973edd2d5

61613250826965 has 16 divisors (see below), whose sum is σ = 98581306335936. Its totient is φ = 32860365436800.

The previous prime is 61613250826859. The next prime is 61613250827003. The reversal of 61613250826965 is 56962805231616.

It is not a de Polignac number, because 61613250826965 - 28 = 61613250826709 is a prime.

It is a super-2 number, since 2×616132508269652 (a number of 28 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 61613250826899 and 61613250826908.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18952545 + ... + 21964185.

It is an arithmetic number, because the mean of its divisors is an integer number (6161331645996).

Almost surely, 261613250826965 is an apocalyptic number.

It is an amenable number.

61613250826965 is a deficient number, since it is larger than the sum of its proper divisors (36968055508971).

61613250826965 is a wasteful number, since it uses less digits than its factorization.

61613250826965 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 4375540.

The product of its (nonzero) digits is 27993600, while the sum is 60.

The spelling of 61613250826965 in words is "sixty-one trillion, six hundred thirteen billion, two hundred fifty million, eight hundred twenty-six thousand, nine hundred sixty-five".

Divisors: 1 3 5 15 1363891 3011641 4091673 6819455 9034923 15058205 20458365 45174615 4107550055131 12322650165393 20537750275655 61613250826965