Search a number
-
+
1695530913055 = 5726920534339
BaseRepresentation
bin11000101011000101100…
…001001000110100011111
320000002110110112200110021
4120223011201020310133
5210234421403204210
63334525515453011
7233332556652400
oct30530541106437
96002413480407
101695530913055
115a4085aa8401
12234731a57167
13c3b70893725
145c0c7dab9a7
152e1882d9bda
hex18ac5848d1f

1695530913055 has 12 divisors (see below), whose sum is σ = 2366822744280. Its totient is φ = 1162649768784.

The previous prime is 1695530913053. The next prime is 1695530913067. The reversal of 1695530913055 is 5503190355961.

It is not a de Polignac number, because 1695530913055 - 21 = 1695530913053 is a prime.

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

It is a congruent number.

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

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 11 ways as a sum of consecutive naturals, for example, 3460266925 + ... + 3460267414.

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

Almost surely, 21695530913055 is an apocalyptic number.

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

1695530913055 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 2733750, while the sum is 52.

The spelling of 1695530913055 in words is "one trillion, six hundred ninety-five billion, five hundred thirty million, nine hundred thirteen thousand, fifty-five".

Divisors: 1 5 7 35 49 245 6920534339 34602671695 48443740373 242218701865 339106182611 1695530913055