Search a number
-
+
10363300014137 = 71480471430591
BaseRepresentation
bin1001011011001110010011…
…0100001110100000111001
31100200201111012022011200112
42112303210310032200321
52324243014300423022
634012500113114105
72116503143456060
oct226634464164071
940621435264615
1010363300014137
113336061761894
1211b4588258935
135a23412ccba5
1427b82d1051d7
1512e88e90b8e2
hex96ce4d0e839

10363300014137 has 4 divisors (see below), whose sum is σ = 11843771444736. Its totient is φ = 8882828583540.

The previous prime is 10363300014113. The next prime is 10363300014149. The reversal of 10363300014137 is 73141000336301.

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 10363300014137 - 226 = 10363232905273 is a prime.

It is a super-3 number, since 3×103633000141373 (a number of 40 digits) contains 333 as substring.

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

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

Almost surely, 210363300014137 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1480471430598.

The product of its (nonzero) digits is 13608, while the sum is 32.

The spelling of 10363300014137 in words is "ten trillion, three hundred sixty-three billion, three hundred million, fourteen thousand, one hundred thirty-seven".

Divisors: 1 7 1480471430591 10363300014137