Search a number
-
+
10643015013403 = 73145794726211
BaseRepresentation
bin1001101011100000010100…
…1000010001010000011011
31101200110111000102101200011
42122320011020101100123
52343333343320412103
634345200020222351
72145634555645543
oct232700510212033
941613430371604
1010643015013403
11343374a56a873
12123a83023a9b7
135c282a6a8286
1428b1a6174323
15136cb1304d6d
hex9ae0521141b

10643015013403 has 4 divisors (see below), whose sum is σ = 10788809739688. Its totient is φ = 10497220287120.

The previous prime is 10643015013391. The next prime is 10643015013427. The reversal of 10643015013403 is 30431051034601.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 10643015013403 - 221 = 10643012916251 is a prime.

It is a super-2 number, since 2×106430150134032 (a number of 27 digits) contains 22 as substring.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 210643015013403 is an apocalyptic number.

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

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

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

The sum of its prime factors is 145794726284.

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

The spelling of 10643015013403 in words is "ten trillion, six hundred forty-three billion, fifteen million, thirteen thousand, four hundred three".

Divisors: 1 73 145794726211 10643015013403