Search a number
-
+
14269200951 = 312737451971
BaseRepresentation
bin11010100101000001…
…01011101000110111
31100211110000111212010
431102200223220313
5213210403412301
610315530255303
71013414130645
oct152240535067
940743014763
1014269200951
116062656965
122922887533
131465315095
14995150195
15587aab5d6
hex35282ba37

14269200951 has 8 divisors (see below), whose sum is σ = 19175409664. Its totient is φ = 9437896440.

The previous prime is 14269200949. The next prime is 14269200961. The reversal of 14269200951 is 15900296241.

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

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

It is not a de Polignac number, because 14269200951 - 21 = 14269200949 is a prime.

It is a super-2 number, since 2×142692009512 (a number of 21 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 (14269200961) 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, 18725605 + ... + 18726366.

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

Almost surely, 214269200951 is an apocalyptic number.

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

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

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

The sum of its prime factors is 37452101.

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

The spelling of 14269200951 in words is "fourteen billion, two hundred sixty-nine million, two hundred thousand, nine hundred fifty-one".

Divisors: 1 3 127 381 37451971 112355913 4756400317 14269200951