Search a number
-
+
505235253242013 = 3784787283756019
BaseRepresentation
bin111001011100000100011111…
…1110011000010100010011101
32110020220000111111011201000020
41302320020333303002202131
51012210233244312221023
64550313512055422353
7211264020365324220
oct16270107763024235
92406800444151006
10505235253242013
11136a90081aa9a88
12487b9b880849b9
13188bb6315a7028
148ca9733cb15b7
153d624dd498de3
hex1cb823fcc289d

505235253242013 has 16 divisors (see below), whose sum is σ = 769891373560320. Its totient is φ = 288702452905776.

The previous prime is 505235253241969. The next prime is 505235253242029. The reversal of 505235253242013 is 310242352532505.

It is not a de Polignac number, because 505235253242013 - 210 = 505235253240989 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2505235253242013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 283840816.

The product of its (nonzero) digits is 1080000, while the sum is 42.

The spelling of 505235253242013 in words is "five hundred five trillion, two hundred thirty-five billion, two hundred fifty-three million, two hundred forty-two thousand, thirteen".

Divisors: 1 3 7 21 84787 254361 593509 1780527 283756019 851268057 1986292133 5958876399 24058821582953 72176464748859 168411751080671 505235253242013