Base | Representation |
---|---|
bin | 1011100111011100001… |
… | …00011001101011000001 |
3 | 1102011020010121210221211 |
4 | 11303232010121223001 |
5 | 23014410031403434 |
6 | 503205221050121 |
7 | 40556561364040 |
oct | 5635604315301 |
9 | 1364203553854 |
10 | 399131122369 |
11 | 1442a8127811 |
12 | 65430256941 |
13 | 2b83a620775 |
14 | 15464a28557 |
15 | a5b04b8464 |
hex | 5cee119ac1 |
399131122369 has 4 divisors (see below), whose sum is σ = 456149854144. Its totient is φ = 342112390596.
The previous prime is 399131122319. The next prime is 399131122387. The reversal of 399131122369 is 963221131993.
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 399131122369 - 213 = 399131114177 is a prime.
It is a super-2 number, since 2×3991311223692 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (399131122309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28509365877 + ... + 28509365890.
It is an arithmetic number, because the mean of its divisors is an integer number (114037463536).
Almost surely, 2399131122369 is an apocalyptic number.
It is an amenable number.
399131122369 is a deficient number, since it is larger than the sum of its proper divisors (57018731775).
399131122369 is an equidigital number, since it uses as much as digits as its factorization.
399131122369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57018731774.
The product of its digits is 472392, while the sum is 49.
The spelling of 399131122369 in words is "three hundred ninety-nine billion, one hundred thirty-one million, one hundred twenty-two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •