Search a number
-
+
15679629961 = 101155243861
BaseRepresentation
bin11101001101001010…
…00010101010001001
31111110201222201201121
432212211002222021
5224102441124321
611111512515241
71063361440612
oct164645025211
944421881647
1015679629961
116716819076
1230570abb21
13162b5a5768
14a8a5b8c09
1561b811441
hex3a6942a89

15679629961 has 4 divisors (see below), whose sum is σ = 15834873924. Its totient is φ = 15524386000.

The previous prime is 15679629949. The next prime is 15679630063. The reversal of 15679629961 is 16992697651.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 14509647936 + 1169982025 = 120456^2 + 34205^2 .

It is a cyclic number.

It is not a de Polignac number, because 15679629961 - 25 = 15679629929 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 15679629961.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 77621830 + ... + 77622031.

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

Almost surely, 215679629961 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 155243962.

The product of its digits is 11022480, while the sum is 61.

The spelling of 15679629961 in words is "fifteen billion, six hundred seventy-nine million, six hundred twenty-nine thousand, nine hundred sixty-one".

Divisors: 1 101 155243861 15679629961