Search a number
-
+
1001301101301 = 331710511001801
BaseRepresentation
bin11101001001000100011…
…00100100101011110101
310112201112101200012221010
432210202030210223311
5112401131040220201
62043554045342433
7132225113634204
oct16444214445365
93481471605833
101001301101301
11356716405626
12142085867a19
13735649cab77
143666b17323b
151b0a5ac2bd6
hexe922324af5

1001301101301 has 16 divisors (see below), whose sum is σ = 1340555335488. Its totient is φ = 664794480000.

The previous prime is 1001301101263. The next prime is 1001301101389. The reversal of 1001301101301 is 1031011031001.

It is not a de Polignac number, because 1001301101301 - 27 = 1001301101173 is a prime.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1001301101401) 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 15 ways as a sum of consecutive naturals, for example, 498601 + ... + 1500401.

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

Almost surely, 21001301101301 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1003172.

The product of its (nonzero) digits is 9, while the sum is 12.

Adding to 1001301101301 its reverse (1031011031001), we get a palindrome (2032312132302).

The spelling of 1001301101301 in words is "one trillion, one billion, three hundred one million, one hundred one thousand, three hundred one".

Divisors: 1 3 317 951 1051 3153 333167 999501 1001801 3005403 317570917 952712751 1052892851 3158678553 333767033767 1001301101301