Search a number
-
+
14955055941 = 371741890913
BaseRepresentation
bin11011110110110010…
…00000101101000101
31102121020120120000210
431323121000231011
5221111443242231
610511550430033
71036412610120
oct157331005505
942536516023
1014955055941
116384814971
122a94502319
131544441037
14a1c2853b7
155c7dd7a46
hex37b640b45

14955055941 has 16 divisors (see below), whose sum is σ = 24129166464. Its totient is φ = 8043055104.

The previous prime is 14955055931. The next prime is 14955055963.

14955055941 is nontrivially palindromic in base 10.

14955055941 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 14955055941 - 213 = 14955047749 is a prime.

It is a congruent number.

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

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

Almost surely, 214955055941 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 41890940.

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

Subtracting from 14955055941 its product of nonzero digits (810000), we obtain a palindrome (14954245941).

The spelling of 14955055941 in words is "fourteen billion, nine hundred fifty-five million, fifty-five thousand, nine hundred forty-one".

Divisors: 1 3 7 17 21 51 119 357 41890913 125672739 293236391 712145521 879709173 2136436563 4985018647 14955055941