Search a number
-
+
15677483142 = 232612913857
BaseRepresentation
bin11101001100111001…
…10110100010000110
31111110120221122211210
432212130312202012
5224101413430032
611111354512250
71063334256636
oct164634664206
944416848753
1015677483142
116715592142
123056435686
13162b003559
14a8a1ba6c6
1561b53a2cc
hex3a6736886

15677483142 has 8 divisors (see below), whose sum is σ = 31354966296. Its totient is φ = 5225827712.

The previous prime is 15677483111. The next prime is 15677483177. The reversal of 15677483142 is 24138477651.

15677483142 is digitally balanced in base 2 and base 5, because in such bases 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.

15677483142 is an admirable number.

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

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 1306456923 + ... + 1306456934.

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

Almost surely, 215677483142 is an apocalyptic number.

15677483142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 2612913862.

The product of its digits is 1128960, while the sum is 48.

The spelling of 15677483142 in words is "fifteen billion, six hundred seventy-seven million, four hundred eighty-three thousand, one hundred forty-two".

Divisors: 1 2 3 6 2612913857 5225827714 7838741571 15677483142