Search a number
-
+
1113830690393 = 3313365047403
BaseRepresentation
bin10000001101010101011…
…110111000111001011001
310221110222202221122012002
4100031111132320321121
5121222111124043033
62211404201130345
7143320522441031
oct20152536707131
93843882848162
101113830690393
1139a411429433
1215ba4b7899b5
13810592b7145
143bca42aa8c1
151de8ecdd3e8
hex103557b8e59

1113830690393 has 4 divisors (see below), whose sum is σ = 1117195738128. Its totient is φ = 1110465642660.

The previous prime is 1113830690333. The next prime is 1113830690411. The reversal of 1113830690393 is 3930960383111.

It is a happy number.

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 1113830690393 - 234 = 1096650821209 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 21113830690393 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3365047734.

The product of its (nonzero) digits is 314928, while the sum is 47.

The spelling of 1113830690393 in words is "one trillion, one hundred thirteen billion, eight hundred thirty million, six hundred ninety thousand, three hundred ninety-three".

Divisors: 1 331 3365047403 1113830690393