Base | Representation |
---|---|
bin | 111010001110011011001… |
… | …101111101111111110101 |
3 | 112011111211210212012112201 |
4 | 322032123031331333311 |
5 | 1011023443440322434 |
6 | 12302045014344501 |
7 | 562035633433312 |
oct | 72163315757765 |
9 | 15144753765481 |
10 | 4001218682869 |
11 | 13029a86a90a1 |
12 | 54756805b131 |
13 | 23040c431965 |
14 | db935133d09 |
15 | 6e132e86614 |
hex | 3a39b37dff5 |
4001218682869 has 2 divisors, whose sum is σ = 4001218682870. Its totient is φ = 4001218682868.
The previous prime is 4001218682843. The next prime is 4001218682933. The reversal of 4001218682869 is 9682868121004.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2055366659025 + 1945852023844 = 1433655^2 + 1394938^2 .
It is a cyclic number.
It is not a de Polignac number, because 4001218682869 - 235 = 3966858944501 is a prime.
It is a super-2 number, since 2×40012186828692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4001218682969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2000609341434 + 2000609341435.
It is an arithmetic number, because the mean of its divisors is an integer number (2000609341435).
Almost surely, 24001218682869 is an apocalyptic number.
It is an amenable number.
4001218682869 is a deficient number, since it is larger than the sum of its proper divisors (1).
4001218682869 is an equidigital number, since it uses as much as digits as its factorization.
4001218682869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2654208, while the sum is 55.
The spelling of 4001218682869 in words is "four trillion, one billion, two hundred eighteen million, six hundred eighty-two thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •