Search a number
-
+
201056075361 = 3222339563929
BaseRepresentation
bin1011101100111111100…
…0000011111001100001
3201012221221110212112200
42323033320003321201
511243230323402421
6232210333243413
720345233304631
oct2731770037141
9635857425480
10201056075361
11782a3a05259
1232b71333569
1315c62060b3b
149a344686c1
15536b030726
hex2ecfe03e61

201056075361 has 6 divisors (see below), whose sum is σ = 290414331090. Its totient is φ = 134037383568.

The previous prime is 201056075347. The next prime is 201056075377. The reversal of 201056075361 is 163570650102.

201056075361 is a `hidden beast` number, since 2 + 0 + 10 + 5 + 607 + 5 + 36 + 1 = 666.

It can be written as a sum of positive squares in only one way, i.e., 149722563600 + 51333511761 = 386940^2 + 226569^2 .

It is not a de Polignac number, because 201056075361 - 211 = 201056073313 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (201056075261) by changing a digit.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11169781956 + ... + 11169781973.

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

Almost surely, 2201056075361 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 22339563935 (or 22339563932 counting only the distinct ones).

The product of its (nonzero) digits is 37800, while the sum is 36.

The spelling of 201056075361 in words is "two hundred one billion, fifty-six million, seventy-five thousand, three hundred sixty-one".

Divisors: 1 3 9 22339563929 67018691787 201056075361