Search a number
-
+
1303515150133 = 7186216450019
BaseRepresentation
bin10010111101111111100…
…011101011011100110101
311121121121012201120200211
4102331333203223130311
5132324044334301013
62434454313305421
7163114214650450
oct22757743533465
94547535646624
101303515150133
114628aa357549
12190768705271
1395bc8439831
144713a36c497
1523d9282623d
hex12f7f8eb735

1303515150133 has 4 divisors (see below), whose sum is σ = 1489731600160. Its totient is φ = 1117298700108.

The previous prime is 1303515150109. The next prime is 1303515150137. The reversal of 1303515150133 is 3310515153031.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 1303515150133 - 237 = 1166076196661 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 93108225003 + ... + 93108225016.

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

Almost surely, 21303515150133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 186216450026.

The product of its (nonzero) digits is 10125, while the sum is 31.

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

Divisors: 1 7 186216450019 1303515150133