Search a number
-
+
1013515151321 = 1789669871217
BaseRepresentation
bin11101011111110100011…
…01011110011111011001
310120220001121120020201002
432233322031132133121
5113101134334320241
62053334043034345
7133136564433401
oct16577215363731
93526047506632
101013515151321
11360913976142
1214451420b9b5
13747602c8aba
14370a938d801
151b56d02589b
hexebfa35e7d9

1013515151321 has 8 divisors (see below), whose sum is σ = 1085191373160. Its totient is φ = 943178672128.

The previous prime is 1013515151291. The next prime is 1013515151417. The reversal of 1013515151321 is 1231515153101.

It is a happy number.

It can be written as a sum of positive squares in 4 ways, for example, as 437464510921 + 576050640400 = 661411^2 + 758980^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1013515151321 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

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

Almost surely, 21013515151321 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 669871323.

The product of its (nonzero) digits is 2250, while the sum is 29.

The spelling of 1013515151321 in words is "one trillion, thirteen billion, five hundred fifteen million, one hundred fifty-one thousand, three hundred twenty-one".

Divisors: 1 17 89 1513 669871217 11387810689 59618538313 1013515151321