Search a number
1302010112013 = 31333384874667
BaseRepresentation
bin10010111100100101110…
…110011010100000001101
311121110201022201201112020
4102330211312122200031
5132313004042041023
62434045111200353
7163032011230302
oct22744566324015
94543638651466
101302010112013
114621a7846096
121904086760b9
1395a186a2330
14470365170a9
1523d05633de3
hex12f25d9a80d

1302010112013 has 8 divisors (see below), whose sum is σ = 1869552981408. Its totient is φ = 801236991984.

The previous prime is 1302010112009. The next prime is 1302010112021. The reversal of 1302010112013 is 3102110102031.

Adding to 1302010112013 its reverse (3102110102031), we get a palindrome (4404120214044).

It is a happy number.

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

It is not a de Polignac number, because 1302010112013 - 22 = 1302010112009 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1302010112003) 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, 16692437295 + ... + 16692437372.

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

Almost surely, 21302010112013 is an apocalyptic number.

1302010112013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.

It is an amenable number.

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

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

1302010112013 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 33384874683.

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

The spelling of 1302010112013 in words is "one trillion, three hundred two billion, ten million, one hundred twelve thousand, thirteen".