Search a number
-
+
399709115161 = 1267131545191
BaseRepresentation
bin1011101000100001000…
…01010001001100011001
31102012201102012220000021
411310100201101030121
523022101013141121
6503342425310441
740610110264156
oct5642041211431
91365642186007
10399709115161
11144574414304
1265571935421
132b9002b2435
14154bb6c322d
15a5e60da641
hex5d10851319

399709115161 has 4 divisors (see below), whose sum is σ = 399740673024. Its totient is φ = 399677557300.

The previous prime is 399709115129. The next prime is 399709115171. The reversal of 399709115161 is 161511907993.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 399709115161 - 25 = 399709115129 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 2399709115161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 31557862.

The product of its (nonzero) digits is 459270, while the sum is 52.

The spelling of 399709115161 in words is "three hundred ninety-nine billion, seven hundred nine million, one hundred fifteen thousand, one hundred sixty-one".

Divisors: 1 12671 31545191 399709115161