Search a number
-
+
990821182147 = 2963334397969
BaseRepresentation
bin11100110101100011000…
…10110110101011000011
310111201111000212011111021
432122301202312223003
5112213200210312042
62035102120330311
7131404321042066
oct16326142665303
93451430764437
10990821182147
113522287aa215
12140040013997
1372584769784
1435d553a48dd
151ab90a16867
hexe6b18b6ac3

990821182147 has 4 divisors (see below), whose sum is σ = 991155583080. Its totient is φ = 990486781216.

The previous prime is 990821182103. The next prime is 990821182163. The reversal of 990821182147 is 741281128099.

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 990821182147 - 27 = 990821182019 is a prime.

It is a super-3 number, since 3×9908211821473 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a Duffinian number.

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

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

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

Almost surely, 2990821182147 is an apocalyptic number.

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

990821182147 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 334400932.

The product of its (nonzero) digits is 580608, while the sum is 52.

The spelling of 990821182147 in words is "nine hundred ninety billion, eight hundred twenty-one million, one hundred eighty-two thousand, one hundred forty-seven".

Divisors: 1 2963 334397969 990821182147