Search a number
-
+
4404227030913 = 31786357392763
BaseRepresentation
bin100000000010111000001…
…1000110011111110000001
3120121001002011011111020110
41000011300120303332001
51034124324104442123
613211135102101533
7633123565036323
oct100056030637601
916531064144213
104404227030913
111448905382946
125b169a87a8a9
1325c4170b81a8
14113246a73613
157986da22493
hex40170633f81

4404227030913 has 8 divisors (see below), whose sum is σ = 6217732279008. Its totient is φ = 2763436568384.

The previous prime is 4404227030881. The next prime is 4404227030993. The reversal of 4404227030913 is 3190307224044.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 4404227030913 - 25 = 4404227030881 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (4404227030993) 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 7 ways as a sum of consecutive naturals, for example, 43178696331 + ... + 43178696432.

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

Almost surely, 24404227030913 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 86357392783.

The product of its (nonzero) digits is 145152, while the sum is 39.

The spelling of 4404227030913 in words is "four trillion, four hundred four billion, two hundred twenty-seven million, thirty thousand, nine hundred thirteen".

Divisors: 1 3 17 51 86357392763 259072178289 1468075676971 4404227030913