Search a number
-
+
14506620131469 = 37171967423417
BaseRepresentation
bin1101001100011001010111…
…1100001001100010001101
31220100211010022002012010110
43103012111330021202031
53400134024223201334
650504125502430233
73025032366411654
oct323062574114215
956324108065113
1014506620131469
11469324a971914
121763591892379
13812c7879457b
143821a49a819b
151a253cd11ae9
hexd3195f0988d

14506620131469 has 8 divisors (see below), whose sum is σ = 19342430155840. Its totient is φ = 9670945097376.

The previous prime is 14506620131461. The next prime is 14506620131533. The reversal of 14506620131469 is 96413102660541.

It is a happy number.

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

It is not a de Polignac number, because 14506620131469 - 23 = 14506620131461 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33496552 + ... + 33926865.

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

Almost surely, 214506620131469 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 67495139.

The product of its (nonzero) digits is 933120, while the sum is 48.

The spelling of 14506620131469 in words is "fourteen trillion, five hundred six billion, six hundred twenty million, one hundred thirty-one thousand, four hundred sixty-nine".

Divisors: 1 3 71719 215157 67423417 202270251 4835540043823 14506620131469