Search a number
-
+
12858066951 = 329373994429
BaseRepresentation
bin10111111100110011…
…01000100000000111
31020012002201110220220
423332121220200013
5202313131120301
65523520555423
7633430523442
oct137631504007
936162643826
1012858066951
1154a9053014
1225aa182b73
13129bb68852
1489d980659
15503c67936
hex2fe668807

12858066951 has 16 divisors (see below), whose sum is σ = 18214600800. Its totient is φ = 8052766848.

The previous prime is 12858066937. The next prime is 12858066967. The reversal of 12858066951 is 15966085821.

12858066951 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 12858066951 - 29 = 12858066439 is a prime.

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

It is a congruent number.

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

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

Almost surely, 212858066951 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3994498.

The product of its (nonzero) digits is 1036800, while the sum is 51.

The spelling of 12858066951 in words is "twelve billion, eight hundred fifty-eight million, sixty-six thousand, nine hundred fifty-one".

Divisors: 1 3 29 37 87 111 1073 3219 3994429 11983287 115838441 147793873 347515323 443381619 4286022317 12858066951