Base | Representation |
---|---|
bin | 111010100001110001111… |
… | …000011001100110100101 |
3 | 112020111111002120110120122 |
4 | 322201301320121212211 |
5 | 1011344023444440042 |
6 | 12315403054211325 |
7 | 563402623630052 |
oct | 72416170314645 |
9 | 15214432513518 |
10 | 4021999999397 |
11 | 13107a2167856 |
12 | 54b5a77b3b45 |
13 | 23237194a363 |
14 | dc9470c0029 |
15 | 6e94c5d87d2 |
hex | 3a871e199a5 |
4021999999397 has 2 divisors, whose sum is σ = 4021999999398. Its totient is φ = 4021999999396.
The previous prime is 4021999999357. The next prime is 4021999999399. The reversal of 4021999999397 is 7939999991204.
4021999999397 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4001604160801 + 20395838596 = 2000401^2 + 142814^2 .
It is a cyclic number.
It is not a de Polignac number, because 4021999999397 - 218 = 4021999737253 is a prime.
Together with 4021999999399, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4021999999399) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2010999999698 + 2010999999699.
It is an arithmetic number, because the mean of its divisors is an integer number (2010999999699).
Almost surely, 24021999999397 is an apocalyptic number.
It is an amenable number.
4021999999397 is a deficient number, since it is larger than the sum of its proper divisors (1).
4021999999397 is an equidigital number, since it uses as much as digits as its factorization.
4021999999397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 803538792, while the sum is 80.
The spelling of 4021999999397 in words is "four trillion, twenty-one billion, nine hundred ninety-nine million, nine hundred ninety-nine thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •