Search a number
-
+
13990305646 = 26995152823
BaseRepresentation
bin11010000011110001…
…10001111101101110
31100010000020011102101
431001320301331232
5212123004240041
610232124445314
71003456431052
oct150170617556
940100204371
1013990305646
115a2a187779
1228653a983a
13141c5c6485
1496a0b1c62
1556d36ab31
hex341e31f6e

13990305646 has 4 divisors (see below), whose sum is σ = 20985458472. Its totient is φ = 6995152822.

The previous prime is 13990305607. The next prime is 13990305691. The reversal of 13990305646 is 64650309931.

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

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

It is a congruent number.

It is an unprimeable number.

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 as a sum of consecutive naturals, namely, 3497576410 + ... + 3497576413.

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

Almost surely, 213990305646 is an apocalyptic number.

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

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

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

The sum of its prime factors is 6995152825.

The product of its (nonzero) digits is 524880, while the sum is 46.

The spelling of 13990305646 in words is "thirteen billion, nine hundred ninety million, three hundred five thousand, six hundred forty-six".

Divisors: 1 2 6995152823 13990305646