Base | Representation |
---|---|
bin | 111010000010011101010… |
… | …101010001011111100111 |
3 | 112010021200022101101201222 |
4 | 322002131111101133213 |
5 | 1010321140012002104 |
6 | 12252122002410555 |
7 | 561102336160601 |
oct | 72023525213747 |
9 | 15107608341658 |
10 | 3988369250279 |
11 | 12a8504513217 |
12 | 544b80960a5b |
13 | 22c1422ca1cb |
14 | db0767a0171 |
15 | 6db2ed771be |
hex | 3a09d5517e7 |
3988369250279 has 2 divisors, whose sum is σ = 3988369250280. Its totient is φ = 3988369250278.
The previous prime is 3988369250269. The next prime is 3988369250357. The reversal of 3988369250279 is 9720529638893.
3988369250279 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (9720529638893) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3988369250279 - 220 = 3988368201703 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3988369250269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1994184625139 + 1994184625140.
It is an arithmetic number, because the mean of its divisors is an integer number (1994184625140).
Almost surely, 23988369250279 is an apocalyptic number.
3988369250279 is a deficient number, since it is larger than the sum of its proper divisors (1).
3988369250279 is an equidigital number, since it uses as much as digits as its factorization.
3988369250279 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 352719360, while the sum is 71.
The spelling of 3988369250279 in words is "three trillion, nine hundred eighty-eight billion, three hundred sixty-nine million, two hundred fifty thousand, two hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •