Search a number
-
+
1000000050515 = 51491342281947
BaseRepresentation
bin11101000110101001010…
…01011101010101010011
310112121011201111222202222
432203110221131111103
5112341000003104030
62043221011331255
7132150635116214
oct16432451352523
93477151458688
101000000050515
11356108a5a944
12141981bb0b2b
13733b82b582b
143658645b40b
151b02b7763e5
hexe8d4a5d553

1000000050515 has 8 divisors (see below), whose sum is σ = 1208053753200. Its totient is φ = 794630912032.

The previous prime is 1000000050509. The next prime is 1000000050607. The reversal of 1000000050515 is 5150500000001.

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 1000000050515 - 228 = 999731615059 is a prime.

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

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 671140229 + ... + 671141718.

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

Almost surely, 21000000050515 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1342282101.

The product of its (nonzero) digits is 125, while the sum is 17.

Adding to 1000000050515 its reverse (5150500000001), we get a palindrome (6150500050516).

The spelling of 1000000050515 in words is "one trillion, fifty thousand, five hundred fifteen".

Divisors: 1 5 149 745 1342281947 6711409735 200000010103 1000000050515